12-weeks supervised exercise training is a feasible and efficacious treatment for reducing depression in youth with major depressive disorder

Introduction: Major Depressive Disorder (MDD) has high prevalence among adolescents and young adults. Evidence of any effective treatments is limited. Exercise as an effective treatment for adults has some support but studies in younger populations are lacking. Therefore the aim of this study was to investigate the feasibility and preliminary efficacy of brief motivational interviewing (MI) plus 12-weeks exercise training as a treatment for MDD in youth...

The use of circular surface aerators in wastewater treatment tanks

Aeration experiments were conducted in different sized baffled and unbaffled circular surface aeration tanks to study their relative performance on oxygen transfer process while aerating the same volume of water. Experiments were carried out with the objective of ascertaining the effect of baffle on oxygen transfer coefficient k. Simulation equations govern the oxygen transfer coefficient with the theoretical power per unit volume, X and actual power per unit volume, P-V. It has been found that, for any given X, circular tanks with baffle produce higher values of k than unbaffled circular tanks, but in terms of actual power consumption unbaffled tanks consume less power when compared to baffled circular tanks to achieve the same value of k. It has been found that in terms of energy consumption, epsilon, baffled tanks consume more energy than unbaffled tanks at any value of X. This suggests that the unbaffled circular tank gives a better performance as far as energy consumption is concerned and hence better economy. An example illustrating the energy conservation to aerate the same volume of water in both types of aerators is given. (c) 2007 Society of Chemical Industry.

Afatinib versus gefitinib as first-line treatment of patients with EGFR mutation-positive non-small-cell lung cancer (LUX-Lung 7): a phase 2B, open-label, randomised controlled trial

Background The irreversible ErbB family blocker afatinib and the reversible EGFR tyrosine kinase inhibitor gefitinib are approved for first-line treatment of EGFR mutation-positive non-small-cell lung cancer (NSCLC). We aimed to compare the efficacy and safety of afatinib and gefitinib in this setting. Methods This multicentre, international, open-label, exploratory, randomised controlled phase 2B trial (LUX-Lung 7) was done at 64 centres in 13 countries. Treatment-naive patients with stage IIIB or IV NSCLC and a common EGFR mutation (exon 19 deletion or Leu858Arg) were randomly assigned (1:1) to receive afatinib (40 mg per day) or gefitinib (250 mg per day) until disease progression, or beyond if deemed beneficial by the investigator. Randomisation, stratified by EGFR mutation type and status of brain metastases, was done centrally using a validated number generating system implemented via an interactive voice or web-based response system with a block size of four. Clinicians and patients were not masked to treatment allocation; independent review of tumour response was done in a blinded manner. Coprimary endpoints were progression-free survival by independent central review, time-to-treatment failure, and overall survival. Efficacy analyses were done in the intention-to-treat population and safety analyses were done in patients who received at least one dose of study drug. This ongoing study is registered with ClinicalTrials.gov, number NCT01466660. Findings Between Dec 13, 2011, and Aug 8, 2013, 319 patients were randomly assigned (160 to afatinib and 159 to gefitinib). Median follow-up was 27·3 months (IQR 15·3–33·9). Progression-free survival (median 11·0 months [95% CI 10·6–12·9] with afatinib vs 10·9 months [9·1–11·5] with gefitinib; hazard ratio [HR] 0·73 [95% CI 0·57–0·95], p=0·017) and time-to-treatment failure (median 13·7 months [95% CI 11·9–15·0] with afatinib vs 11·5 months [10·1–13·1] with gefitinib; HR 0·73 [95% CI 0·58–0·92], p=0·0073) were significantly longer with afatinib than with gefitinib. Overall survival data are not mature. The most common treatment-related grade 3 or 4 adverse events were diarrhoea (20 [13%] of 160 patients given afatinib vs two [1%] of 159 given gefitinib) and rash or acne (15 [9%] patients given afatinib vs five [3%] of those given gefitinib) and liver enzyme elevations (no patients given afatinib vs 14 [9%] of those given gefitinib). Serious treatment-related adverse events occurred in 17 (11%) patients in the afatinib group and seven (4%) in the gefitinib group. Ten (6%) patients in each group discontinued treatment due to drug-related adverse events. 15 (9%) fatal adverse events occurred in the afatinib group and ten (6%) in the gefitinib group. All but one of these deaths were considered unrelated to treatment; one patient in the gefitinib group died from drug-related hepatic and renal failure. Interpretation Afatinib significantly improved outcomes in treatment-naive patients with EGFR-mutated NSCLC compared with gefitinib, with a manageable tolerability profile. These data are potentially important for clinical decision making in this patient population.

Cilengitide combined with cetuximab and platinum-based chemotherapy as first-line treatment in advanced non-small-cell lung cancer (NSCLC) patients: Results of an open-label, randomized, controlled phase II study (CERTO)

Background: This multicentre, open-label, randomized, controlled phase II study evaluated cilengitide in combination with cetuximab and platinum-based chemotherapy, compared with cetuximab and chemotherapy alone, as first-line treatment of patients with advanced non-small-cell lung cancer (NSCLC). Patients and methods: Patients were randomized 1:1:1 to receive cetuximab plus platinum-based chemotherapy alone (control), or combined with cilengitide 2000 mg 1×/week i.v. (CIL-once) or 2×/week i.v. (CIL-twice). A protocol amendment limited enrolment to patients with epidermal growth factor receptor (EGFR) histoscore ≥200 and closed the CIL-twice arm for practical feasibility issues. Primary end point was progression-free survival (PFS; independent read); secondary end points included overall survival (OS), safety, and biomarker analyses. A comparison between the CIL-once and control arms is reported, both for the total cohorts, as well as for patients with EGFR histoscore ≥200. Results: There were 85 patients in the CIL-once group and 84 in the control group. The PFS (independent read) was 6.2 versus 5.0 months for CIL-once versus control [hazard ratio (HR) 0.72; P = 0.085]; for patients with EGFR histoscore ≥200, PFS was 6.8 versus 5.6 months, respectively (HR 0.57; P = 0.0446). Median OS was 13.6 for CIL-once versus 9.7 months for control (HR 0.81; P = 0.265). In patients with EGFR ≥200, OS was 13.2 versus 11.8 months, respectively (HR 0.95; P = 0.855). No major differences in adverse events between CIL-once and control were reported; nausea (59% versus 56%, respectively) and neutropenia (54% versus 46%, respectively) were the most frequent. There was no increased incidence of thromboembolic events or haemorrhage in cilengitide-treated patients. αvβ3 and αvβ5 expression was neither a predictive nor a prognostic indicator. Conclusions: The addition of cilengitide to cetuximab/chemotherapy indicated potential clinical activity, with a trend for PFS difference in the independent-read analysis. However, the observed inconsistencies across end points suggest additional investigations are required to substantiate a potential role of other integrin inhibitors in NSCLC treatment.

Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm

The Ball-Larus path-profiling algorithm is an efficient technique to collect acyclic path frequencies of a program. However, longer paths -those extending across loop iterations - describe the runtime behaviour of programs better. We generalize the Ball-Larus profiling algorithm for profiling k-iteration paths - paths that can span up to to k iterations of a loop. We show that it is possible to number suchk-iteration paths perfectly, thus allowing for an efficient profiling algorithm for such longer paths. We also describe a scheme for mixed-mode profiling: profiling different parts of a procedure with different path lengths. Experimental results show that k-iteration profiling is realistic.

Micro-treatment options for components of organic fraction of MSW in residential areas

There is a growing interest in management of MSW through micro-treatment of organic fraction of municipal solid wastes (OFMSW) in many cities of India. The OFMSW fraction is high (> 80%) in many pockets within South Indian cities like Bangalore, Chikkamagalur, etc. and is largely represented by vegetable, fruit, packing and garden wastes. Among these, the last three have shown problems for easy decomposition. Fruit wastes are characterized by a large pectin supported fraction that decomposes quickly to organic acids (becomes pulpy) that eventually slow down anaerobic and aerobic decomposition processes. Paper fraction (newsprint and photocopying paper) as well as paddy straw (packing), bagasse (from cane juice stalls) and tree leaf litter (typical garden waste and street sweepings) are found in reasonably large proportions in MSW. These decompose slowly due to poor nutrients or physical state. We have examined the suitability of these substrates for micro-composting in plastic bins by tracking decomposition pattern and physical changes. It was found that fruit wastes decompose rapidly to produce organic acids and large leachate fraction such that it may need to be mixed with leachate absorbing materials (dry wastes) for good composting. Leaf litter, paddy straw and bagasse decompose to the tune of 90, 68 and 60% VS and are suitable for composting micro-treatment. Paper fractions even when augmented with 10% leaf compost failed to show appreciable decomposition in 50 days. All these feedstocks were found to have good biological methane potential (BMP) and showed promise for conversion to biogas under a mixed feed operation. Suitability of this approach was verified by operating a plug-flow type anaerobic digester where only leaf litter gathered nearby (as street sweepings) was used as feedstock. Here only a third of the BMP was realized at this scale (0.18 m(3) biogas/kg VS 0.55 m(3)/kg in BMP). We conclude that anaerobic digestion in plug-flow like digesters appear a more suitable micro-treatment option (2-10 kg VS/day) because in addition to compost it also produces biogas for domestic use nearby.

Modified density matrix renormalization group algorithm for the zigzag spin-1/2 chain with frustrated antiferromagnetic exchange: Comparison with field theory at large J(2)/J(1)

A modified density matrix renormalization group (DMRG) algorithm is applied to the zigzag spin-1/2 chain with frustrated antiferromagnetic exchange J(1) and J(2) between first and second neighbors. The modified algorithm yields accurate results up to J(2)/J(1) approximate to 4 for the magnetic gap Delta to the lowest triplet state, the amplitude B of the bond order wave phase, the wavelength lambda of the spiral phase, and the spin correlation length xi. The J(2)/J(1) dependences of Delta, B, lambda, and xi provide multiple comparisons to field theories of the zigzag chain. The twist angle of the spiral phase and the spin structure factor yield additional comparisons between DMRG and field theory. Attention is given to the numerical accuracy required to obtain exponentially small gaps or exponentially long correlations near a quantum phase transition.

A genetic algorithm with characteristic amplification through multiple geographically isolated populations and varied fitness landscapes

This paper proposes a new approach, wherein multiple populations are evolved on different landscapes. The problem statement is broken down, to describe discrete characteristics. Each landscape, described by its fitness landscape is used to optimize or amplify a certain characteristic or set of characteristics. Individuals from each of these populations are kept geographically isolated from each other Each population is evolved individually. After a predetermined number of evolutions, the system of populations is analysed against a normalized fitness function. Depending on this score and a predefined merging scheme, the populations are merged, one at a time, while continuing evolution. Merging continues until only one final population remains. This population is then evolved, following which the resulting population will contain the optimal solution. The final resulting population will contain individuals which have been optimized against all characteristics as desired by the problem statement. Each individual population is optimized for a local maxima. Thus when populations are merged, the effect is to produce a new population which is closer to the global maxima.

A genetic algorithm with characteristic amplification through multiple geographically isolated populations and varied fitness landscapes

This paper proposes a new approach, wherein multiple populations are evolved on different landscapes. The problem statement is broken down, to describe discrete characteristics. Each landscape, described by its fitness landscape is used to optimize or amplify a certain characteristic or set of characteristics. Individuals from each of these populations are kept geographically isolated from each other Each population is evolved individually. After a predetermined number of evolutions, the system of populations is analysed against a normalized fitness function. Depending on this score and a predefined merging scheme, the populations are merged, one at a time, while continuing evolution. Merging continues until only one final population remains. This population is then evolved, following which the resulting population will contain the optimal solution. The final resulting population will contain individuals which have been optimized against all characteristics as desired by the problem statement. Each individual population is optimized for a local maxima. Thus when populations are merged, the effect is to produce a new population which is closer to the global maxima.

A fast dual algorithm for kernel logistic regression

This paper gives a new iterative algorithm for kernel logistic regression. It is based on the solution of a dual problem using ideas similar to those of the Sequential Minimal Optimization algorithm for Support Vector Machines. Asymptotic convergence of the algorithm is proved. Computational experiments show that the algorithm is robust and fast. The algorithmic ideas can also be used to give a fast dual algorithm for solving the optimization problem arising in the inner loop of Gaussian Process classifiers.

RACK: RApid Clustering using K-means algorithm

The k-means algorithm is an extremely popular technique for clustering data. One of the major limitations of the k-means is that the time to cluster a given dataset D is linear in the number of clusters, k. In this paper, we employ height balanced trees to address this issue. Specifically, we make two major contributions, (a) we propose an algorithm, RACK (acronym for RApid Clustering using k-means), which takes time favorably comparable with the fastest known existing techniques, and (b) we prove an expected bound on the quality of clustering achieved using RACK. Our experimental results on large datasets strongly suggest that RACK is competitive with the k-means algorithm in terms of quality of clustering, while taking significantly less time.

A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time

The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.

Delay optimal control algorithm for a multiaccess fading channel with peak power constraint

We consider an optimal power and rate scheduling problem for a multiaccess fading wireless channel with the objective of minimising a weighted sum of mean packet transmission delay subject to a peak power constraint. The base station acts as a controller which, depending upon the buffer lengths and the channel state of each user, allocates transmission rate and power to individual users. We assume perfect channel state information at the transmitter and the receiver. We also assume a Markov model for the fading and packet arrival processes. The policy obtained represents a form of Indexability.

Pareto-optimal solutions for multi-objective optimization of fed-batch bioreactors using nondominated sorting genetic algorithm

Many optimal control problems are characterized by their multiple performance measures that are often noncommensurable and competing with each other. The presence of multiple objectives in a problem usually give rise to a set of optimal solutions, largely known as Pareto-optimal solutions. Evolutionary algorithms have been recognized to be well suited for multi-objective optimization because of their capability to evolve a set of nondominated solutions distributed along the Pareto front. This has led to the development of many evolutionary multi-objective optimization algorithms among which Nondominated Sorting Genetic Algorithm (NSGA and its enhanced version NSGA-II) has been found effective in solving a wide variety of problems. Recently, we reported a genetic algorithm based technique for solving dynamic single-objective optimization problems, with single as well as multiple control variables, that appear in fed-batch bioreactor applications. The purpose of this study is to extend this methodology for solution of multi-objective optimal control problems under the framework of NSGA-II. The applicability of the technique is illustrated by solving two optimal control problems, taken from literature, which have usually been solved by several methods as single-objective dynamic optimization problems. (C) 2004 Elsevier Ltd. All rights reserved.