Persistent clinical efficacy and safety of anti-tumour necrosis factor \textgreeka therapy with infliximab in patients with ankylosing spondylitis over 5 years: evidence for different types of response

Background: There is insufficient evidence for the long-term efficacy and safety of anti-tumour necrosis factor therapy in patients with ankylosing spondylitis (AS). This is the first report on the treatment with infliximab over 5 years.Methods: As part of a multicentre randomised trial, 69 patients with active AS at baseline (BL) have been continuously treated with infliximab (5 mg/kg i.v. every 6 weeks)---except for a short discontinuation after 3 years (FU1). The primary outcome of this extension was remission according to the ASsessment in Ankylosing Spondylitis (ASAS) criteria at the end of year 5 of the study (FU2).Results: Of the 43 patients who completed year 3, 42 agreed to continue, 38 of which (90.5%) finished year 5 (55% of 69 initially). Partial clinical remission was achieved in 13 of 38 patients (34.2%) at FU1 and FU2. At FU2, the mean Bath Ankylosing Spondylitis Disease Activity Index (BASDAI) was 2.5±1.9 (BL:6.4, FU1:2.5). BASDAI values <4 were seen in 79% of patients at both, FU1 and FU2. ASAS 20% and 40% responses were seen in 32 (84%) and 24 (63%) patients at FU2, respectively. Most patients classified as non-responders at FU2 were part-time responders, as all but one patient achieved an ASAS 20% response at least once within the last 2 years. Three types of responders were identified. No major side effects occurred during years 4 and 5 of infliximab therapy.Conclusions: Infliximab is safe and efficacious in AS patients over 5 years. The majority of the patients remained on treatment and had rather persistent levels of low disease activity. Different response types could be identified

An analysis of the Taguchi method for tuning a memetic algorithm with reduced computational time budget

Determining the best initial parameter values for an algorithm, called parameter tuning, is crucial to obtaining better algorithm performance; however, it is often a time-consuming task and needs to be performed under a restricted computational budget. In this study, the results from our previous work on using the Taguchi method to tune the parameters of a memetic algorithm for cross-domain search are further analysed and extended. Although the Taguchi method reduces the time spent finding a good parameter value combination by running a smaller size of experiments on the training instances from different domains as opposed to evaluating all combinations, the time budget is still larger than desired. This work investigates the degree to which it is possible to predict the same good parameter setting faster by using a reduced time budget. The results in this paper show that it was possible to predict good combinations of parameter settings with a much reduced time budget. The good final parameter values are predicted for three of the parameters, while for the fourth parameter there is no clear best value, so one of three similarly performing values is identified at each time instant

Determinisitic Optical Fock State Generation

We present a scheme for the deterministic generation of N-photon Fock states from N three-level atoms in a high-finesse optical cavity. The method applies an external laser pulsethat generates an $N$-photon output state while adiabatically keeping the atom-cavity system within a subspace of optically dark states. We present analytical estimates of the error due to amplitude leakage from these dark states for general N, and compare it with explicit results of numerical simulations for N \leq 5. The method is shown to provide a robust source of N-photon states under a variety of experimental conditions and is suitable for experimental implementation using a cloud of cold atoms magnetically trapped in a cavity. The resulting N-photon states have potential applications in fundamental studies of non-classical states and in quantum information processing.Comment: 25 pages, 9 figure

Composing first species counterpoint with a variable neighbourhood search algorithm

In this article, a variable neighbourhood search (VNS) algorithm is developed that can generate musical fragments consisting of a melody for the cantus firmus and the first species counterpoint. The objective function of the algorithm is based on a quantification of existing rules for counterpoint. The VNS algorithm developed in this article is a local search algorithm that starts from a randomly generated melody and improves it by changing one or two notes at a time. A thorough parametric analysis of the VNS reveals the significance of the algorithm's parameters on the quality of the composed fragment, as well as their optimal settings. A comparison of the VNS algorithm with a developed genetic algorithm shows that the VNS is more efficient. The VNS algorithm has been implemented in a user-friendly software environment for composition, called Optimuse. Optimuse allows a user to specify a number of characteristics such as length, key and mode. Based on this information, Optimuse 'composes' both cantus firmus and first species counterpoint. Alternatively, the user may specify a cantus firmus, and let Optimuse compose the accompanying first species counterpoint. © 2012 Taylor & Francis