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.

A robust optimization approach for index tracking problem

Index tracking is an investment approach where the primary objective is to keep portfolio return as close as possible to a target index without purchasing all index components. The main purpose is to minimize the tracking error between the returns of the selected portfolio and a benchmark. In this paper, quadratic as well as linear models are presented for minimizing the tracking error. The uncertainty is considered in the input data using a tractable robust framework that controls the level of conservatism while maintaining linearity. The linearity of the proposed robust optimization models allows a simple implementation of an ordinary optimization software package to find the optimal robust solution. The proposed model of this paper employs Morgan Stanley Capital International Index as the target index and the results are reported for six national indices including Japan, the USA, the UK, Germany, Switzerland and France. The performance of the proposed models is evaluated using several financial criteria e.g. information ratio, market ratio, Sharpe ratio and Treynor ratio. The preliminary results demonstrate that the proposed model lowers the amount of tracking error while raising values of portfolio performance measures.

A penalty-based genetic algorithm for the migration cost-aware virtual machine placement problem in cloud data centers

In the past few years, the virtual machine (VM) placement problem has been studied intensively and many algorithms for the VM placement problem have been proposed. However, those proposed VM placement algorithms have not been widely used in today's cloud data centers as they do not consider the migration cost from current VM placement to the new optimal VM placement. As a result, the gain from optimizing VM placement may be less than the loss of the migration cost from current VM placement to the new VM placement. To address this issue, this paper presents a penalty-based genetic algorithm (GA) for the VM placement problem that considers the migration cost in addition to the energy-consumption of the new VM placement and the total inter-VM traffic flow in the new VM placement. The GA has been implemented and evaluated by experiments, and the experimental results show that the GA outperforms two well known algorithms for the VM placement problem.

Experimental studies on the performance of rail joints with modified wheel/railhead contact

Rail joints are provided with a gap to account for thermal movement and to maintain electrical insulation for the control of signals and/or broken rail detection circuits. The gap in the rail joint is regarded as a source of significant problems for the rail industry since it leads to a very short rail service life compared with other track components due to the various, and difficult to predict, failure modes – thus increasing the risk for train operations. Many attempts to improve the life of rail joints have led to a large number of patents around the world; notable attempts include strengthening through larger-sized joint bars, an increased number of bolts and the use of high yield materials. Unfortunately, no design to date has shown the ability to prolong the life of the rail joints to values close to those for continuously welded rail (CWR). This paper reports the results of a fundamental study that has revealed that the wheel contact at the free edge of the railhead is a major problem since it generates a singularity in the contact pressure and railhead stresses. A design was therefore developed using an optimisation framework that prevents wheel contact at the railhead edge. Finite element modelling of the design has shown that the contact pressure and railhead stress singularities are eliminated, thus increasing the potential to work as effectively as a CWR that does not have a geometric gap. An experimental validation of the finite element results is presented through an innovative non-contact measurement of strains. Some practical issues related to grinding rails to the optimal design are also discussed.

An anticipative reactive control strategy to deal with unforeseen obstacles during a multi-sensor-based navigation task

We address the problem of the rangefinder-based avoidance of unforeseen static obstacles during a visual navigation task. We extend previous strategies which are efficient in most cases but remain still hampered by some drawbacks (e.g., risks of collisions or of local minima in some particular cases, etc.). The key idea is to complete the control strategy by adding a controller providing the robot some anticipative skills to guarantee non collision and by defining more general transition conditions to deal with local minima. Simulation results show the proposed strategy efficiency.

One practical algorithm for both stochastic and adversarial bandits

We present an algorithm for multiarmed bandits that achieves almost optimal performance in both stochastic and adversarial regimes without prior knowledge about the nature of the environment. Our algorithm is based on augmentation of the EXP3 algorithm with a new control lever in the form of exploration parameters that are tailored individually for each arm. The algorithm simultaneously applies the “old” control lever, the learning rate, to control the regret in the adversarial regime and the new control lever to detect and exploit gaps between the arm losses. This secures problem-dependent “logarithmic” regret when gaps are present without compromising on the worst-case performance guarantee in the adversarial regime. We show that the algorithm can exploit both the usual expected gaps between the arm losses in the stochastic regime and deterministic gaps between the arm losses in the adversarial regime. The algorithm retains “logarithmic” regret guarantee in the stochastic regime even when some observations are contaminated by an adversary, as long as on average the contamination does not reduce the gap by more than a half. Our results for the stochastic regime are supported by experimental validation.

Tracking adversarial targets

We study linear control problems with quadratic losses and adversarially chosen tracking targets. We present an efficient algorithm for this problem and show that, under standard conditions on the linear system, its regret with respect to an optimal linear policy grows as O(log^2 T), where T is the number of rounds of the game. We also study a problem with adversarially chosen transition dynamics; we present an exponentiallyweighted average algorithm for this problem, and we give regret bounds that grow as O(sqtr p T).

Deriving optimal fishing effort for managing Australia's Moreton Bay multispecies trawl fishery with aggregated effort data

Deriving an estimate of optimal fishing effort or even an approximate estimate is very valuable for managing fisheries with multiple target species. The most challenging task associated with this is allocating effort to individual species when only the total effort is recorded. Spatial information on the distribution of each species within a fishery can be used to justify the allocations, but often such information is not available. To determine the long-term overall effort required to achieve maximum sustainable yield (MSY) and maximum economic yield (MEY), we consider three methods for allocating effort: (i) optimal allocation, which optimally allocates effort among target species; (ii) fixed proportions, which chooses proportions based on past catch data; and (iii) economic allocation, which splits effort based on the expected catch value of each species. Determining the overall fishing effort required to achieve these management objectives is a maximizing problem subject to constraints due to economic and social considerations. We illustrated the approaches using a case study of the Moreton Bay Prawn Trawl Fishery in Queensland (Australia). The results were consistent across the three methods. Importantly, our analysis demonstrated the optimal total effort was very sensitive to daily fishing costs-the effort ranged from 9500-11 500 to 6000-7000, 4000 and 2500 boat-days, using daily cost estimates of $0, $500, $750, and $950, respectively. The zero daily cost corresponds to the MSY, while a daily cost of $750 most closely represents the actual present fishing cost. Given the recent debate on which costs should be factored into the analyses for deriving MEY, our findings highlight the importance of including an appropriate cost function for practical management advice. The approaches developed here could be applied to other multispecies fisheries where only aggregated fishing effort data are recorded, as the literature on this type of modelling is sparse.

Optimal designs for evaluating a series of treatments

Several articles in this journal have studied optimal designs for testing a series of treatments to identify promising ones for further study. These designs formulate testing as an ongoing process until a promising treatment is identified. This formulation is considered to be more realistic but substantially increases the computational complexity. In this article, we show that these new designs, which control the error rates for a series of treatments, can be reformulated as conventional designs that control the error rates for each individual treatment. This reformulation leads to a more meaningful interpretation of the error rates and hence easier specification of the error rates in practice. The reformulation also allows us to use conventional designs from published tables or standard computer programs to design trials for a series of treatments. We illustrate these using a study in soft tissue sarcoma.

Variable Size Population NSGA-II: VPNSGA-II

Multi-objective optimization is an active field of research with broad applicability in aeronautics. This report details a variant of the original NSGA-II software aimed to improve the performances of such a widely used Genetic Algorithm in finding the optimal Pareto-front of a Multi-Objective optimization problem for the use of UAV and aircraft design and optimsaiton. Original NSGA-II works on a population of predetermined constant size and its computational cost to evaluate one generation is O(mn^2 ), being m the number of objective functions and n the population size. The basic idea encouraging this work is that of reduce the computational cost of the NSGA-II algorithm by making it work on a population of variable size, in order to obtain better convergence towards the Pareto-front in less time. In this work some test functions will be tested with both original NSGA-II and VPNSGA-II algorithms; each test will be timed in order to get a measure of the computational cost of each trial and the results will be compared.

A near Optimal Cane Rail Scheduler under Limited and Unlimited Capacity Constraints

Australia is the world’s third largest exporter of raw sugar after Brazil and Thailand, with around $2.0 billion in export earnings. Transport systems play a vital role in the raw sugar production process by transporting the sugarcane crop between farms and mills. In 2013, 87 per cent of sugarcane was transported to mills by cane railway. The total cost of sugarcane transport operations is very high. Over 35% of the total cost of sugarcane production in Australia is incurred in cane transport. A cane railway network mainly involves single track sections and multiple track sections used as passing loops or sidings. The cane railway system performs two main tasks: delivering empty bins from the mill to the sidings for filling by harvesters; and collecting the full bins of cane from the sidings and transporting them to the mill. A typical locomotive run involves an empty train (locomotive and empty bins) departing from the mill, traversing some track sections and delivering bins at specified sidings. The locomotive then, returns to the mill, traversing the same track sections in reverse order, collecting full bins along the way. In practice, a single track section can be occupied by only one train at a time, while more than one train can use a passing loop (parallel sections) at a time. The sugarcane transport system is a complex system that includes a large number of variables and elements. These elements work together to achieve the main system objectives of satisfying both mill and harvester requirements and improving the efficiency of the system in terms of low overall costs. These costs include delay, congestion, operating and maintenance costs. An effective cane rail scheduler will assist the traffic officers at the mill to keep a continuous supply of empty bins to harvesters and full bins to the mill with a minimum cost. This paper addresses the cane rail scheduling problem under rail siding capacity constraints where limited and unlimited siding capacities were investigated with different numbers of trains and different train speeds. The total operating time as a function of the number of trains, train shifts and a limited number of cane bins have been calculated for the different siding capacity constraints. A mathematical programming approach has been used to develop a new scheduler for the cane rail transport system under limited and unlimited constraints. The new scheduler aims to reduce the total costs associated with the cane rail transport system that are a function of the number of bins and total operating costs. The proposed metaheuristic techniques have been used to find near optimal solutions of the cane rail scheduling problem and provide different possible solutions to avoid being stuck in local optima. A numerical investigation and sensitivity analysis study is presented to demonstrate that high quality solutions for large scale cane rail scheduling problems are obtainable in a reasonable time. Keywords: Cane railway, mathematical programming, capacity, metaheuristics

A novel approach to 6-DOF adaptive trajectory tracking control of an AUV in the presence of parameter uncertainties

In this paper, the trajectory tracking control of an autonomous underwater vehicle (AUVs) in six-degrees-of-freedom (6-DOFs) is addressed. It is assumed that the system parameters are unknown and the vehicle is underactuated. An adaptive controller is proposed, based on Lyapunov׳s direct method and the back-stepping technique, which interestingly guarantees robustness against parameter uncertainties. The desired trajectory can be any sufficiently smooth bounded curve parameterized by time even if consist of straight line. In contrast with the majority of research in this field, the likelihood of actuators׳ saturation is considered and another adaptive controller is designed to overcome this problem, in which control signals are bounded using saturation functions. The nonlinear adaptive control scheme yields asymptotic convergence of the vehicle to the reference trajectory, in the presence of parametric uncertainties. The stability of the presented control laws is proved in the sense of Lyapunov theory and Barbalat׳s lemma. Efficiency of presented controller using saturation functions is verified through comparing numerical simulations of both controllers.