Adaptive plasticity and genetic divergence in feeding efficiency during parallel adaptive radiation of whitefish (Coregonus spp.)

Parallel phenotypic divergence in replicated adaptive radiations could either result from parallel genetic divergence in response to similar divergent selec- tion regimes or from equivalent phenotypically plastic response to the repeated occurrence of contrasting environments. In post-glacial fish, repli- cated divergence in phenotypes along the benthic-limnetic habitat axis is commonly observed. Here, we use two benthic-limnetic species pairs of whitefish from two Swiss lakes, raised in a common garden design, with reciprocal food treatments in one species pair, to experimentally measure whether feeding efficiency on benthic prey has a genetic basis or whether it underlies phenotypic plasticity (or both). To do so, we offered experimental fish mosquito larvae, partially burried in sand, and measured multiple feed- ing efficiency variables. Our results reveal both, genetic divergence as well as phenotypically plastic divergence in feeding efficiency, with the pheno- typically benthic species raised on benthic food being the most efficient forager on benthic prey. This indicates that both, divergent natural selection on genetically heritable traits and adaptive phenotypic plasticity, are likely important mechanisms driving phenotypic divergence in adaptive radiation.

Treatment of idiopathic pulmonary fibrosis with ambrisentan: a parallel, randomized trial

BACKGROUND Idiopathic pulmonary fibrosis (IPF) is characterized by formation and proliferation of fibroblast foci. Endothelin-1 induces lung fibroblast proliferation and contractile activity via the endothelin A (ETA) receptor. OBJECTIVE To determine whether ambrisentan, an ETA receptor-selective antagonist, reduces the rate of IPF progression. DESIGN Randomized, double-blind, placebo-controlled, event-driven trial. (ClinicalTrials.gov: NCT00768300). SETTING Academic and private hospitals. PARTICIPANTS Patients with IPF aged 40 to 80 years with minimal or no honeycombing on high-resolution computed tomography scans. INTERVENTION Ambrisentan, 10 mg/d, or placebo. MEASUREMENTS Time to disease progression, defined as death, respiratory hospitalization, or a categorical decrease in lung function. RESULTS The study was terminated after enrollment of 492 patients (75% of intended enrollment; mean duration of exposure to study medication, 34.7 weeks) because an interim analysis indicated a low likelihood of showing efficacy for the end point by the scheduled end of the study. Ambrisentan-treated patients were more likely to meet the prespecified criteria for disease progression (90 [27.4%] vs. 28 [17.2%] patients; P = 0.010; hazard ratio, 1.74 [95% CI, 1.14 to 2.66]). Lung function decline was seen in 55 (16.7%) ambrisentan-treated patients and 19 (11.7%) placebo-treated patients (P = 0.109). Respiratory hospitalizations were seen in 44 (13.4%) and 9 (5.5%) patients in the ambrisentan and placebo groups, respectively (P = 0.007). Twenty-six (7.9%) patients who received ambrisentan and 6 (3.7%) who received placebo died (P = 0.100). Thirty-two (10%) ambrisentan-treated patients and 16 (10%) placebo-treated patients had pulmonary hypertension at baseline, and analysis stratified by the presence of pulmonary hypertension revealed similar results for the primary end point. LIMITATION The study was terminated early. CONCLUSION Ambrisentan was not effective in treating IPF and may be associated with an increased risk for disease progression and respiratory hospitalizations. PRIMARY FUNDING SOURCE Gilead Sciences.

Three-dimensional, task-specific robot therapy of the arm after stroke: a multicentre, parallel-group randomised trial

BACKGROUND: Arm hemiparesis secondary to stroke is common and disabling. We aimed to assess whether robotic training of an affected arm with ARMin--an exoskeleton robot that allows task-specific training in three dimensions-reduces motor impairment more effectively than does conventional therapy. METHODS: In a prospective, multicentre, parallel-group randomised trial, we enrolled patients who had had motor impairment for more than 6 months and moderate-to-severe arm paresis after a cerebrovascular accident who met our eligibility criteria from four centres in Switzerland. Eligible patients were randomly assigned (1:1) to receive robotic or conventional therapy using a centre-stratified randomisation procedure. For both groups, therapy was given for at least 45 min three times a week for 8 weeks (total 24 sessions). The primary outcome was change in score on the arm (upper extremity) section of the Fugl-Meyer assessment (FMA-UE). Assessors tested patients immediately before therapy, after 4 weeks of therapy, at the end of therapy, and 16 weeks and 34 weeks after start of therapy. Assessors were masked to treatment allocation, but patients, therapists, and data analysts were unmasked. Analyses were by modified intention to treat. This study is registered with ClinicalTrials.gov, number NCT00719433. FINDINGS: Between May 4, 2009, and Sept 3, 2012, 143 individuals were tested for eligibility, of whom 77 were eligible and agreed to participate. 38 patients assigned to robotic therapy and 35 assigned to conventional therapy were included in analyses. Patients assigned to robotic therapy had significantly greater improvements in motor function in the affected arm over the course of the study as measured by FMA-UE than did those assigned to conventional therapy (F=4.1, p=0.041; mean difference in score 0.78 points, 95% CI 0.03-1.53). No serious adverse events related to the study occurred. INTERPRETATION: Neurorehabilitation therapy including task-oriented training with an exoskeleton robot can enhance improvement of motor function in a chronically impaired paretic arm after stroke more effectively than conventional therapy. However, the absolute difference between effects of robotic and conventional therapy in our study was small and of weak significance, which leaves the clinical relevance in question.

Scheduling of continuous and discontinuous material flows with intermediate storage restrictions

This paper deals with scheduling batch (i.e., discontinuous), continuous, and semicontinuous production in process industries (e.g., chemical, pharmaceutical, or metal casting industries) where intermediate storage facilities and renewable resources (processing units and manpower) of limited capacity have to be observed. First, different storage configurations typical of process industries are discussed. Second, a basic scheduling problem covering the three above production modes is presented. Third, (exact and truncated) branch-and-bound methods for the basic scheduling problem and the special case of batch scheduling are proposed and subjected to an experimental performance analysis. The solution approach presented is flexible and in principle simple, and it can (approximately) solve relatively large problem instances with sufficient accuracy.

Scheduling the factory pick-up of new cars

Car manufacturers increasingly offer delivery programs for the factory pick-up of new cars. Such a program consists of a broad range of event-marketing activities. In this paper we investigate the problem of scheduling the delivery program activities of one day such that the sum of the customers’ waiting times is minimized. We show how to model this problem as a resource-constrained project scheduling problem with nonregular objective function, and we present a relaxation-based beam-search solution heuristic. The relaxations are solved by exploiting a duality relationship between temporal scheduling and min-cost network flow problems. This approach has been developed in cooperation with a German automaker. The performance of the heuristic has been evaluated based on practical and randomly generated test instances.

Scheduling the production of rolling ingots: Industrial context, model, and solution method

We study a real-world scheduling problem arising in the context of a rolling ingots production. First we review the production process and discuss peculiarities that have to be observed when scheduling a given set of production orders on the production facilities. We then show how to model this scheduling problem using prescribed time lags between operations, different kinds of resources, and sequence-dependent changeovers. A branch-and-bound solution procedure is presented in the second part. The basic principle is to relax the resource constraints by assuming infinite resource availability. Resulting resource conflicts are then stepwise resolved by introducing precedence relationships among operations competing for the same resources. The algorithm has been implemented as a beam search heuristic enumerating alternative sets of precedence relationships.

Advanced production scheduling for batch plants in process industries

An Advanced Planning System (APS) offers support at all planning levels along the supply chain while observing limited resources. We consider an APS for process industries (e.g. chemical and pharmaceutical industries) consisting of the modules network design (for long–term decisions), supply network planning (for medium–term decisions), and detailed production scheduling (for short–term decisions). For each module, we outline the decision problem, discuss the specifi cs of process industries, and review state–of–the–art solution approaches. For the module detailed production scheduling, a new solution approach is proposed in the case of batch production, which can solve much larger practical problems than the methods known thus far. The new approach decomposes detailed production scheduling for batch production into batching and batch scheduling. The batching problem converts the primary requirements for products into individual batches, where the work load is to be minimized. We formulate the batching problem as a nonlinear mixed–integer program and transform it into a linear mixed–binary program of moderate size, which can be solved by standard software. The batch scheduling problem allocates the batches to scarce resources such as processing units, workers, and intermediate storage facilities, where some regular objective function like the makespan is to be minimized. The batch scheduling problem is modelled as a resource–constrained project scheduling problem, which can be solved by an efficient truncated branch–and–bound algorithm developed recently. The performance of the new solution procedures for batching and batch scheduling is demonstrated by solving several instances of a case study from process industries.

Batch scheduling in process industries: an application of resource-constrained project scheduling

The paper deals with batch scheduling problems in process industries where final products arise from several successive chemical or physical transformations of raw materials using multi–purpose equipment. In batch production mode, the total requirements of intermediate and final products are partitioned into batches. The production start of a batch at a given level requires the availability of all input products. We consider the problem of scheduling the production of given batches such that the makespan is minimized. Constraints like minimum and maximum time lags between successive production levels, sequence–dependent facility setup times, finite intermediate storages, production breaks, and time–varying manpower contribute to the complexity of this problem. We propose a new solution approach using models and methods of resource–constrained project scheduling, which (approximately) solves problems of industrial size within a reasonable amount of time.

Storage problems in batch scheduling

This paper is concerned with the modelling of storage configurations for intermediate products in process industries. Those models form the basis of algorithms for scheduling chemical production plants. Different storage capacity settings (unlimited, finite, and no intermediate storage), storage homogeneity settings (dedicated and shared storage), and storage time settings (unlimited, finite, and no wait) are considered. We discuss a classification of storage constraints in batch scheduling and show how those constraints can be integrated into a general production scheduling model that is based on the concept of cumulative resources.