A genetic algorithm to ensemble feature selection

We are going to implement the "GA-SEFS" by Tsymbal and analyse experimentally its performance depending on the classifier algorithms used in the fitness function (NB, MNge, SMO). We are also going to study the effect of adding to the fitness function a measure to control complexity of the base classifiers.

Risk assessment of recurrence in sporadic retinoblastoma using a molecular-based algorithm.

PURPOSE: Most RB1 mutations are unique and distributed throughout the RB1 gene. Their detection can be time-consuming and the yield especially low in cases of conservatively-treated sporadic unilateral retinoblastoma (Rb) patients. In order to identify patients with true risk of developing Rb, and to reduce the number of unnecessary examinations under anesthesia in all other cases, we developed a universal sensitive, efficient and cost-effective strategy based on intragenic haplotype analysis. METHODS: This algorithm allows the calculation of the a posteriori risk of developing Rb and takes into account (a) RB1 loss of heterozygosity in tumors, (b) preferential paternal origin of new germline mutations, (c) a priori risk derived from empirical data by Vogel, and (d) disease penetrance of 90% in most cases. We report the occurrence of Rb in first degree relatives of patients with sporadic Rb who visited the Jules Gonin Eye Hospital, Lausanne, Switzerland, from January 1994 to December 2006 compared to expected new cases of Rb using our algorithm. RESULTS: A total of 134 families with sporadic Rb were enrolled; testing was performed in 570 individuals and 99 patients younger than 4 years old were identified. We observed one new case of Rb. Using our algorithm, the cumulated total a posteriori risk of recurrence was 1.77. CONCLUSIONS: This is the first time that linkage analysis has been validated to monitor the risk of recurrence in sporadic Rb. This should be a useful tool in genetic counseling, especially when direct RB1 screening for mutations leaves a negative result or is unavailable.

Treatment algorithm for moderate to severe ulcerative colitis.

The care for a patient with ulcerative colitis (UC) remains challenging despite the fact that morbidity and mortality rates have been considerably reduced during the last 30 years. The traditional management with intravenous corticosteroids was modified by the introduction of ciclosporin and infliximab. In this review, we focus on the treatment of patients with moderate to severe UC. Four typical clinical scenarios are defined and discussed in detail. The treatment recommendations are based on current literature, published guidelines and reviews, and were discussed at a consensus meeting of Swiss experts in the field. Comprehensive treatment algorithms were developed, aimed for daily clinical practice.

Conditional and syllogistic deductive tasks dissociate functionally during premise integration.

Deduction allows us to draw consequences from previous knowledge. Deductive reasoning can be applied to several types of problem, for example, conditional, syllogistic, and relational. It has been assumed that the same cognitive operations underlie solutions to them all; however, this hypothesis remains to be tested empirically. We used event-related fMRI, in the same group of subjects, to compare reasoning-related activity associated with conditional and syllogistic deductive problems. Furthermore, we assessed reasoning-related activity for the two main stages of deduction, namely encoding of premises and their integration. Encoding syllogistic premises for reasoning was associated with activation of BA 44/45 more than encoding them for literal recall. During integration, left fronto-lateral cortex (BA 44/45, 6) and basal ganglia activated with both conditional and syllogistic reasoning. Besides that, integration of syllogistic problems additionally was associated with activation of left parietal (BA 7) and left ventro-lateral frontal cortex (BA 47). This difference suggests a dissociation between conditional and syllogistic reasoning at the integration stage. Our finding indicates that the integration of conditional and syllogistic reasoning is carried out by means of different, but partly overlapping, sets of anatomical regions and by inference, cognitive processes. The involvement of BA 44/45 during both encoding (syllogisms) and premise integration (syllogisms and conditionals) suggests a central role in deductive reasoning for syntactic manipulations and formal/linguistic representations.

Algorithm optimization for solving crew scheduling problems

In this paper, we are proposing a methodology to determine the most efficient and least costly way of crew pairing optimization. We are developing a methodology based on algorithm optimization on Eclipse opensource IDE using the Java programming language to solve the crew scheduling problems.

Proactive motivation and engagement in career behaviors: Investigating direct, mediated, and moderated effects

Proactive career behaviors become increasingly important in today's career environment, but little is known about how and when motivational patterns affect individual differences. In a six-month longitudinal study among German university students (Study 1; N = 289) it was demonstrated that motivation in terms of "can do" (self-efficacy and context beliefs), "reason to" (autonomous career goals), and "energized to" (positive affect) significantly predicted career behaviors. Contrary to expectation, negative context beliefs had a positive effect when combined with other motivational states. Study 2 replicated and extended those results by investigating whether "can do" motivation mediates the effect of proactive personality and whether those effects are conditional upon the degree of career choice decidedness. We tested a moderated multiple mediation model with a unique sample of 134 German students, assessed three times, each interval being 6 weeks apart. The results showed that effects of proactivity were partially carried through higher self-efficacy beliefs but not context beliefs. Supporting a moderation model, indirect effects through self-efficacy beliefs were not present for students with very low decidedness.

Development and validation of AMANDA, a new algorithm for selecting highly relevant regions in Molecular Interaction Fields

Descriptors based on Molecular Interaction Fields (MIF) are highly suitable for drug discovery, but their size (thousands of variables) often limits their application in practice. Here we describe a simple and fast computational method that extracts from a MIF a handful of highly informative points (hot spots) which summarize the most relevant information. The method was specifically developed for drug discovery, is fast, and does not require human supervision, being suitable for its application on very large series of compounds. The quality of the results has been tested by running the method on the ligand structure of a large number of ligand-receptor complexes and then comparing the position of the selected hot spots with actual atoms of the receptor. As an additional test, the hot spots obtained with the novel method were used to obtain GRIND-like molecular descriptors which were compared with the original GRIND. In both cases the results show that the novel method is highly suitable for describing ligand-receptor interactions and compares favorably with other state-of-the-art methods.

A systolic array for linear MIMO detection based on an all-swap lattice reduction algorithm

A systolic array to implement lattice-reduction-aided lineardetection is proposed for a MIMO receiver. The lattice reductionalgorithm and the ensuing linear detections are operated in the same array, which can be hardware-efficient. All-swap lattice reduction algorithm (ASLR) is considered for the systolic design.ASLR is a variant of the LLL algorithm, which processes all lattice basis vectors within one iteration. Lattice-reduction-aided linear detection based on ASLR and LLL algorithms have very similarbit-error-rate performance, while ASLR is more time efficient inthe systolic array, especially for systems with a large number ofantennas.

ILS-ESP An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem

From a managerial point of view, the more effcient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most effcient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can affect their performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic "common sense" rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased randomization process of the initial solution to randomly generate different alternative initial solutions of similar quality -which is attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number generator.

The Ins and Outs of Unemployment: A Conditional Analysis

We analyze how unemployment, job finding and job separation rates react to neutral and investment-specific technology shocks. Neutral shocks increase unemployment and explain a substantial portion of unemployment volatility; investment-specific shocks expand employment and hours worked and mostly contribute to hours worked volatility. Movements in the job separation rates are responsible for the impact response of unemployment while job finding rates for movements along its adjustment path. Our evidence qualifies the conclusions by Hall (2005) and Shimer (2007) and warns against using search models with exogenous separation rates to analyze the effects of technology shocks.

Intravitreal chemotherapy for vitreous disease in retinoblastoma revisited: from prohibition to conditional indications.

BACKGROUND: Tumour control of vitreous seeds remains challenging owing to their resistance to radiation and systemic chemotherapy. OBJECTIVE: To describe the short-term efficacy of intravitreal melphalan for vitreous disease in retinoblastoma using a new injection technique and dose. METHODS: This study is a retrospective non-comparative review of 23 consecutive heavily pretreated patients (23 eyes) with active vitreous seeding and eligible for intravitreous chemotherapy (IViC). They received a total of 122 intravitreal injections of melphalan (20-30 μg) given every 7-10 days. The ocular status was objectively monitored under anaesthesia with fundus photography. RESULTS: All patients are alive without evidence of extraocular spread (95% CI 82.19% to 100%). Concomitant treatments, including other chemotherapeutic modalities, were used until complete sterilisation of the retinal seeding source and subretinal seeds. Globe retention was achieved in 87% (20/23) of cases. All retained eyes were in complete remission after a median follow-up period of 22 months (range 9-31 months). The Kaplan-Meier estimate of ocular survival rates at 2 years was 84.14% (95% CI 62.48% to 95.28%). A localised peripheral salt-and-pepper retinopathy was noted in 10 eyes (43%) at the site of injection. CONCLUSIONS: This study reports the first clinically documented case series of patients with retinoblastoma treated with IViC. Despite a possible confounding effect of concomitant chemotherapy prescription using other routes of administration in four of the successfully treated eyes (20%), IViC achieved an unprecedented success rate of tumour control in the presence of vitreous seeding. Of note, none of the treated eyes required external beam irradiation to control the vitreous seeding. Further studies are required to assess IViC retinal toxicity and to better delineate its role in the management of retinoblastoma.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

Parameterized expectations approach; Some practical issues

We discuss some practical issues related to the use of the Parameterized Expectations Approach (PEA) for solving non-linear stochastic dynamic models with rational expectations. This approach has been applied in models of macroeconomics, financial economics, economic growth, contracttheory, etc. It turns out to be a convenient algorithm, especially when there is a large number of state variables and stochastic shocks in the conditional expectations. We discuss some practical issues having to do with the application of the algorithm, and we discuss a Fortran program for implementing the algorithm that is available through the internet.We discuss these issues in a battery of six examples.

Conditional Involvement of CONSTITUTIVE PHOTOMORPHOGENIC1 in the Degradation of Phytochrome A.

All higher plants possess multiple phytochrome photoreceptors, with phytochrome A (phyA) being light labile and other members of the family being relatively light stable (phyB-phyE in Arabidopsis [Arabidopsis thaliana]). phyA also differs from other members of the family because it enables plants to deetiolate in far-red light-rich environments typical of dense vegetational cover. Later in development, phyA counteracts the shade avoidance syndrome. Light-induced degradation of phyA favors the establishment of a robust shade avoidance syndrome and was proposed to be important for phyA-mediated deetiolation in far-red light. phyA is ubiquitylated and targeted for proteasome-mediated degradation in response to light. Cullin1 and the ubiquitin E3 ligase CONSTITUTIVE PHOTOMORPHOGENIC1 (COP1) have been implicated in this process. Here, we systematically analyze the requirement of cullins in this process and show that only CULLIN1 plays an important role in light-induced phyA degradation. In addition, the role of COP1 in this process is conditional and depends on the presence of metabolizable sugar in the growth medium. COP1 acts with SUPPRESSOR OF PHYTOCHROME A (SPA) proteins. Unexpectedly, the light-induced decline of phyA levels is reduced in spa mutants irrespective of the growth medium, suggesting a COP1-independent role for SPA proteins.