Hybrid Algorithms for Routing and Assignment Wavelengths in Optical Networks

This paper presents a strategy for the solution of the WDM optical networks planning. Specifically, the problem of Routing and Wavelength Allocation (RWA) in order to minimize the amount of wavelengths used. In this case, the problem is known as the Min-RWA. Two meta-heuristics (Tabu Search and Simulated Annealing) are applied to take solutions of good quality and high performance. The key point is the degradation of the maximum load on the virtual links in favor of minimization of number of wavelengths used; the objective is to find a good compromise between the metrics of virtual topology (load in Gb/s) and of the physical topology (quantity of wavelengths). The simulations suggest good results when compared to some existing in the literature.

Information Filtering and Array Algorithms for Discrete-Time Markovian Jump Linear Systems

This technical note develops information filter and array algorithms for a linear minimum mean square error estimator of discrete-time Markovian jump linear systems. A numerical example for a two-mode Markovian jump linear system, to show the advantage of using array algorithms to filter this class of systems, is provided.

A Taxonomy for Locality Algorithms on Peer-to-Peer Networks

The continuous growth of peer-to-peer networks has made them responsible for a considerable portion of the current Internet traffic. For this reason, improvements in P2P network resources usage are of central importance. One effective approach for addressing this issue is the deployment of locality algorithms, which allow the system to optimize the peers` selection policy for different network situations and, thus, maximize performance. To date, several locality algorithms have been proposed for use in P2P networks. However, they usually adopt heterogeneous criteria for measuring the proximity between peers, which hinders a coherent comparison between the different solutions. In this paper, we develop a thoroughly review of popular locality algorithms, based on three main characteristics: the adopted network architecture, distance metric, and resulting peer selection algorithm. As result of this study, we propose a novel and generic taxonomy for locality algorithms in peer-to-peer networks, aiming to enable a better and more coherent evaluation of any individual locality algorithm.

Adaptive Approach for a Maximum Entropy Algorithm in Ecological Niche Modeling

This paper presents an Adaptive Maximum Entropy (AME) approach for modeling biological species. The Maximum Entropy algorithm (MaxEnt) is one of the most used methods in modeling biological species geographical distribution. The approach presented here is an alternative to the classical algorithm. Instead of using the same set features in the training, the AME approach tries to insert or to remove a single feature at each iteration. The aim is to reach the convergence faster without affect the performance of the generated models. The preliminary experiments were well performed. They showed an increasing on performance both in accuracy and in execution time. Comparisons with other algorithms are beyond the scope of this paper. Some important researches are proposed as future works.

Reconfiguration of distribution networks to minimize loss and disruption costs using genetic algorithms

In this paper a computational implementation of an evolutionary algorithm (EA) is shown in order to tackle the problem of reconfiguring radial distribution systems. The developed module considers power quality indices such as long duration interruptions and customer process disruptions due to voltage sags, by using the Monte Carlo simulation method. Power quality costs are modeled into the mathematical problem formulation, which are added to the cost of network losses. As for the EA codification proposed, a decimal representation is used. The EA operators, namely selection, recombination and mutation, which are considered for the reconfiguration algorithm, are herein analyzed. A number of selection procedures are analyzed, namely tournament, elitism and a mixed technique using both elitism and tournament. The recombination operator was developed by considering a chromosome structure representation that maps the network branches and system radiality, and another structure that takes into account the network topology and feasibility of network operation to exchange genetic material. The topologies regarding the initial population are randomly produced so as radial configurations are produced through the Prim and Kruskal algorithms that rapidly build minimum spanning trees. (C) 2009 Elsevier B.V. All rights reserved.

Approximate algorithms for credal networks with binary variables

This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All algorithms for approximate inference in this paper rely on exact inferences in credal networks based on polytrees with binary variables, as these inferences have polynomial complexity. We are inspired by approximate algorithms for Bayesian networks; thus the Loopy 2U algorithm resembles Loopy Belief Propagation, while the Iterated Partial Evaluation and Structured Variational 2U algorithms are, respectively, based on Localized Partial Evaluation and variational techniques. (C) 2007 Elsevier Inc. All rights reserved.

Some heuristic algorithms for total tardiness minimization in a flowshop with blocking

The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. Heuristic approaches are proposed to minimize the total tardiness criterion. A constructive heuristic that explores specific characteristics of the problem is presented. Moreover, a GRASP-based heuristic is proposed and Coupled with a path relinking strategy to search for better outcomes. Computational tests are presented and the comparisons made with an adaptation of the NEH algorithm and with a branch-and-bound algorithm indicate that the new approaches are promising. (c) 2007 Elsevier Ltd. All rights reserved.

Evaluation of algorithms used to order markers on genetic maps

When building genetic maps, it is necessary to choose from several marker ordering algorithms and criteria, and the choice is not always simple. In this study, we evaluate the efficiency of algorithms try (TRY), seriation (SER), rapid chain delineation (RCD), recombination counting and ordering (RECORD) and unidirectional growth (UG), as well as the criteria PARF (product of adjacent recombination fractions), SARF (sum of adjacent recombination fractions), SALOD (sum of adjacent LOD scores) and LHMC (likelihood through hidden Markov chains), used with the RIPPLE algorithm for error verification, in the construction of genetic linkage maps. A linkage map of a hypothetical diploid and monoecious plant species was simulated containing one linkage group and 21 markers with fixed distance of 3 cM between them. In all, 700 F(2) populations were randomly simulated with and 400 individuals with different combinations of dominant and co-dominant markers, as well as 10 and 20% of missing data. The simulations showed that, in the presence of co-dominant markers only, any combination of algorithm and criteria may be used, even for a reduced population size. In the case of a smaller proportion of dominant markers, any of the algorithms and criteria (except SALOD) investigated may be used. In the presence of high proportions of dominant markers and smaller samples (around 100), the probability of repulsion linkage increases between them and, in this case, use of the algorithms TRY and SER associated to RIPPLE with criterion LHMC would provide better results. Heredity (2009) 103, 494-502; doi:10.1038/hdy.2009.96; published online 29 July 2009

The sites of neural adaptation induced by resistance training in humans

Although it has long been supposed that resistance training causes adaptive changes in the CNS, the sites and nature of these adaptations have not previously been identified. In order to determine whether the neural adaptations to resistance training occur to a greater extent at cortical or subcortical sites in the CNS, we compared the effects of resistance training on the electromyographic (EMG) responses to transcranial magnetic (TMS) and electrical (TES) stimulation. Motor evoked potentials (MEPs) were recorded from the first dorsal interosseous muscle of 16 individuals before and after 4 weeks of resistance training for the index finger abductors (n = 8), or training involving finger abduction-adduction without external resistance (n = 8). TMS was delivered at rest at intensities from 5 % below the passive threshold to the maximal output of the stimulator. TMS and TES were also delivered at the active threshold intensity while the participants exerted torques ranging from 5 to 60 % of their maximum voluntary contraction (MVC) torque. The average latency of MEPs elicited by TES was significantly shorter than that of TMS MEPs (TES latency = 21.5 ± 1.4 ms; TMS latency = 23.4 ± 1.4 ms; P < 0.05), which indicates that the site of activation differed between the two forms of stimulation. Training resulted in a significant increase in MVC torque for the resistance-training group, but not the control group. There were no statistically significant changes in the corticospinal properties measured at rest for either group. For the active trials involving both TMS and TES, however, the slope of the relationship between MEP size and the torque exerted was significantly lower after training for the resistance-training group (P < 0.05). Thus, for a specific level of muscle activity, the magnitude of the EMG responses to both forms of transcranial stimulation were smaller following resistance training. These results suggest that resistance training changes the functional properties of spinal cord circuitry in humans, but does not substantially affect the organisation of the motor cortex.

Bcl-2 in endothelial cells is increased by vitamin E and alpha-lipoic acid supplementation but not exercise training

Atherosclerotic plaque contains apoptotic endothelial cells with oxidative stress implicated in this process. Vitamin E and a-lipoic acid are a potent antioxidant combination with the potential to prevent endothelial apoptosis. Regular exercise is known to increase myocardial protection, however, little research has investigated the effects of exercise on the endothelium. The purpose of these studies was to investigate the effects of antioxidant supplementation and/or exercise training on proteins that regulate apoptosis in endothelial cells. Male rats received a control or antioxidant-supplemented diet (vitamin E and alpha-lipoic acid) and were assigned to sedentary or exercise-trained groups for 14 weeks. Left ventricular endothelial cells (LVECs) were isolated and levels of the anti-apoptotic protein Bcl-2 and the pro-apoptotic protein Bax were measured. Antioxidant supplementation caused a fourfold increase in Bcl-2 (P < 0.05) with no change in Bax (P > 0.05). Bcl-2:Bax was increased sixfold with antioxidant supplementation compared to non-supplemented animals (P < 0.05). Exercise training had no significant effect on Bcl-2, Bax or Bcl-2:Bax either alone or combined with antioxidant supplementation (P > 0.05) compared to non-supplemented animals. However, Bax was significantly lower (P < 0.05) in the supplemented trained group compared to non-supplemented trained animals. Cultured bovine endothelial cells incubated for 24 h with vitamin E and/or a-lipoic acid showed the combination of the two antioxidants increased Bcl-2 to a greater extent than cells incubated with the vehicle alone. In summary, vitamin E and a-lipoic acid increase endothelial cell Bcl-2, which may provide increased protection against apoptosis. (c) 2005 Elsevier Ltd. All rights reserved

The Scientific Basis for High-Intensity Interval Training: Optimising Training Programmes and Maximising Performance in Highly Trained Endurance Athletes

While the physiological adaptations that occur following endurance training in previously sedentary and recreationally active individuals are relatively well understood, the adaptations to training in already highly trained endurance athletes remain unclear. While significant improvements in endurance performance and corresponding physiological markers are evident following submaximal endurance training in sedentary and recreationally active groups, an additional increase in submaximal training (i.e. volume) in highly trained individuals does not appear to further enhance either endurance performance or associated physiological variables [e.g. peak oxygen uptake (V-dot O2peak), oxidative enzyme activity]. It seems that, for athletes who are already trained, improvements in endurance performance can be achieved only through high-intensity interval training (HIT). The limited research which has examined changes in muscle enzyme activity in highly trained athletes, following HIT, has revealed no change in oxidative or glycolytic enzyme activity, despite significant improvements in endurance performance (p < 0.05). Instead, an increase in skeletal muscle buffering capacity may be one mechanism responsible for an improvement in endurance performance. Changes in plasma volume, stroke volume, as well as muscle cation pumps, myoglobin, capillary density and fibre type characteristics have yet to be investigated in response to HIT with the highly trained athlete. Information relating to HIT programme optimisation in endurance athletes is also very sparse. Preliminary work using the velocity at which V-dot O2max is achieved (Vmax) as the interval intensity, and fractions (50 to 75%) of the time to exhaustion at Vmax (Tmax) as the interval duration has been successful in eliciting improvements in performance in long-distance runners. However, Vmax and Tmax have not been used with cyclists. Instead, HIT programme optimisation research in cyclists has revealed that repeated supramaximal sprinting may be equally effective as more traditional HIT programmes for eliciting improvements in endurance performance. Further examination of the biochemical and physiological adaptations which accompany different HIT programmes, as well as investigation into the optimal HIT programme for eliciting performance enhancements in highly trained athletes is required.

Algorithms for sequence analysis via mutagenesis

Despite many successes of conventional DNA sequencing methods, some DNAs remain difficult or impossible to sequence. Unsequenceable regions occur in the genomes of many biologically important organisms, including the human genome. Such regions range in length from tens to millions of bases, and may contain valuable information such as the sequences of important genes. The authors have recently developed a technique that renders a wide range of problematic DNAs amenable to sequencing. The technique is known as sequence analysis via mutagenesis (SAM). This paper presents a number of algorithms for analysing and interpreting data generated by this technique.

Comparison of BR and QR Eigenvalue Algorithms for Power System Small Signal Stability Analysis

The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.

Challenge or opportunity: can regional training hospitals capitalise on the impending influx of interns?

To the Editor: The increase in medical graduates expected over the next decade presents a huge challenge to the many stakeholders involved in providing their prevocational and vocational medical training. 1 Increased numbers will add significantly to the teaching and supervision workload for registrars and consultants, while specialist training and access to advanced training positions may be compromised. However, this predicament may also provide opportunities for innovation in the way internships are delivered. Although facing these same challenges, regional and rural hospitals could use this situation to enhance their workforce by creating opportunities for interns and junior doctors to acquire valuable experience in non-metropolitan settings. We surveyed a representative sample (n = 147; 52% of total cohort) of Year 3 Bachelor of Medicine and Bachelor of Surgery students at the University of Queensland about their perceptions and expectations of their impending internship and the importance of its location (ie, urban/metropolitan versus regional/rural teaching hospitals) to their future training and career plans. Most students (n = 127; 86%) reported a high degree of contemplation about their internship choice. Issues relating to career progression and support ranked highest in their expectations. Most perceived internships in urban/metropolitan hospitals as more beneficial to their future career prospects compared with regional/rural hospitals, but, interestingly, felt that they would have more patient responsibility and greater contact with and supervision by senior staff in a regional setting (Box). Regional and rural hospitals should try to harness these positive perceptions and act to address any real or perceived shortcomings in order to enhance their future workforce.2 They could look to establish partnerships with rural clinical schools3 to enhance recruitment of interns as early as Year 3. To maximise competitiveness with their urban counterparts, regional and rural hospitals need to offer innovative training and career progression pathways to junior doctors, to combat the perception that internships in urban hospitals are more beneficial to future career prospects. Partnerships between hospitals, medical schools and vocational colleges, with input from postgraduate medical councils, should provide vertical integration4 in the important period between student and doctor. Work is underway to more closely evaluate and compare the intern experience across regional/rural and urban/metropolitan hospitals, and track student experiences and career choices longitudinally. This information may benefit teaching hospitals and help identify the optimal combination of resources necessary to provide quality teaching and a clear career pathway for the expected influx of new interns.