The choice of the best among the shortest routes in transparent optical networks

This work introduces the problem of the best choice among M combinations of the shortest paths for dynamic provisioning of lightpaths in all-optical networks. To solve this problem in an optimized way (shortest path and load balance), a new fixed routing algorithm, named Best among the Shortest Routes (BSR), is proposed. The BSR`s performance is compared in terms of blocking probability and network utilization with Dijkstra`s shortest path algorithm and others algorithms proposed in the literature. The evaluated scenarios include several representative topologies for all-optical networking and different wavelength conversion architectures. For all studied scenarios, BSR achieved superior performance. (C) 2010 Elsevier B.V. All rights reserved.

The Policy Iteration Algorithm for Average Continuous Control of Piecewise Deterministic Markov Processes

The main goal of this paper is to apply the so-called policy iteration algorithm (PIA) for the long run average continuous control problem of piecewise deterministic Markov processes (PDMP`s) taking values in a general Borel space and with compact action space depending on the state variable. In order to do that we first derive some important properties for a pseudo-Poisson equation associated to the problem. In the sequence it is shown that the convergence of the PIA to a solution satisfying the optimality equation holds under some classical hypotheses and that this optimal solution yields to an optimal control strategy for the average control problem for the continuous-time PDMP in a feedback form.

Optimization of the Topology of Electric Energy Distribution Networks by Using Algorithm Inspired on Ant Behaviors

An algorithm inspired on ant behavior is developed in order to find out the topology of an electric energy distribution network with minimum power loss. The algorithm performance is investigated in hypothetical and actual circuits. When applied in an actual distribution system of a region of the State of Sao Paulo (Brazil), the solution found by the algorithm presents loss lower than the topology built by the concessionary company.

Avoiding Divergence in the Shalvi-Weinstein Algorithm

The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the Shalvi-Weinstein algorithm (SWA). It is well-known that SWA presents a higher convergence rate than CMA. at the expense of higher computational complexity. If the forgetting factor is not sufficiently close to one, if the initialization is distant from the optimal solution, or if the signal-to-noise ratio is low, SWA can converge to undesirable local minima or even diverge. In this paper, we show that divergence can be caused by an inconsistency in the nonlinear estimate of the transmitted signal. or (when the algorithm is implemented in finite precision) by the loss of positiveness of the estimate of the autocorrelation matrix, or by a combination of both. In order to avoid the first cause of divergence, we propose a dual-mode SWA. In the first mode of operation. the new algorithm works as SWA; in the second mode, it rejects inconsistent estimates of the transmitted signal. Assuming the persistence of excitation condition, we present a deterministic stability analysis of the new algorithm. To avoid the second cause of divergence, we propose a dual-mode lattice SWA, which is stable even in finite-precision arithmetic, and has a computational complexity that increases linearly with the number of adjustable equalizer coefficients. The good performance of the proposed algorithms is confirmed through numerical simulations.

Hardware/firmware implementation of a soft sensor using an improved version of a fuzzy identification algorithm

This paper presents the design and implementation of an embedded soft sensor, i. e., a generic and autonomous hardware module, which can be applied to many complex plants, wherein a certain variable cannot be directly measured. It is implemented based on a fuzzy identification algorithm called ""Limited Rules"", employed to model continuous nonlinear processes. The fuzzy model has a Takagi-Sugeno-Kang structure and the premise parameters are defined based on the Fuzzy C-Means (FCM) clustering algorithm. The firmware contains the soft sensor and it runs online, estimating the target variable from other available variables. Tests have been performed using a simulated pH neutralization plant. The results of the embedded soft sensor have been considered satisfactory. A complete embedded inferential control system is also presented, including a soft sensor and a PID controller. (c) 2007, ISA. Published by Elsevier Ltd. All rights reserved.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

Chronic methionine load-induced hyperhomocysteinemia impairs the relaxation induced by bradykinin in the isolated rat carotid

This study investigates the effects of chronic methionine intake on bradykinin (BK)-relaxation. Vascular reactivity experiments were performed on carotid rings from male Wistar rats. Treatment with methionine (0.1, 1 or 2 g kg(-1) per day) for 8 and 16 weeks, but not for 2 and 4 weeks, reduced the relaxation induced by BK. Indomethacin, a non-selective cyclooxygenase (COX) inhibitor, and SQ29548, a selective thromboxane A(2) (TXA(2))/prostaglandin H(2) (PGH(2)) receptor antagonist prevented the reduction in BK-relaxation observed in the carotid from methionine-treated rats. Conversely, AH6809, a selective prostaglandin F(2 alpha) (PGF(2 alpha)) receptor antagonist did not alter BK-relaxation in the carotid from methionine-treated rats. The nitric oxide synthase (NOS) inhibitors L-NAME, L-NNA and 7-nitroindazole reduced the relaxation induced by BK in carotids from control and methionine-treated rats. In summary, we found that chronic methionine intake impairs the endothelium-dependent relaxation induced by BK and this effect is due to an increased production of endothelial vasoconstrictor prostanoids (possibly TXA(2)) that counteracts the relaxant action displayed by the peptide.

Effects of memory load and distraction on performance and event-related slow potentials in a visuospatial working memory task

Brain electrical activity related to working memory was recorded at 15 scalp electrodes during a visuospatial delayed response task. Participants (N = 18) touched the remembered position of a target on a computer screen after either a 1 or 8 sec delay. These memory trials were compared to sensory trials in which the target remained present throughout the delay and response periods. Distracter stimuli identical to the target were briefly presented during the delay on 30% of trials. Responses were less accurate in memory than sensory trials, especially after the long delay. During the delay slow potentials developed that were significantly more negative in memory than sensory trials. The difference between memory and sensory trials was greater at anterior than posterior electrodes. On trials with distracters, the slow potentials generated by memory trials showed further enhancement of negativity whereas there were minimal effects on accuracy of performance. The results provide evidence that engagement of visuospatial working memory generates slow wave negativity with a timing and distribution consistent with frontal activation. Enhanced brain activity associated with working memory is required to maintain performance in the presence of distraction. © 1997 by the Massachusetts Institute of Technology

An improved seeded region growing algorithm

Recently Adams and Bischof (1994) proposed a novel region growing algorithm for segmenting intensity images. The inputs to the algorithm are the intensity image and a set of seeds - individual points or connected components - that identify the individual regions to be segmented. The algorithm grows these seed regions until all of the image pixels have been assimilated. Unfortunately the algorithm is inherently dependent on the order of pixel processing. This means, for example, that raster order processing and anti-raster order processing do not, in general, lead to the same tessellation. In this paper we propose an improved seeded region growing algorithm that retains the advantages of the Adams and Bischof algorithm fast execution, robust segmentation, and no tuning parameters - but is pixel order independent. (C) 1997 Elsevier Science B.V.

Prediction of MHC class II-binding peptides using an evolutionary algorithm and artificial neural network

Motivation: Prediction methods for identifying binding peptides could minimize the number of peptides required to be synthesized and assayed, and thereby facilitate the identification of potential T-cell epitopes. We developed a bioinformatic method for the prediction of peptide binding to MHC class II molecules. Results: Experimental binding data and expert knowledge of anchor positions and binding motifs were combined with an evolutionary algorithm (EA) and an artificial neural network (ANN): binding data extraction --> peptide alignment --> ANN training and classification. This method, termed PERUN, was implemented for the prediction of peptides that bind to HLA-DR4(B1*0401). The respective positive predictive values of PERUN predictions of high-, moderate-, low- and zero-affinity binder-a were assessed as 0.8, 0.7, 0.5 and 0.8 by cross-validation, and 1.0, 0.8, 0.3 and 0.7 by experimental binding. This illustrates the synergy between experimentation and computer modeling, and its application to the identification of potential immunotheraaeutic peptides.

Effect of load distance on self-selected manual lifting technique

The aim of this research is to determine the effects of constraining the horizontal distance of the feet from the load on the posture adopted at the start of the lift. Kinematic data were collected while each of 24 subjects lifted 3, 6, and 9 kg loads from a starting height 18 cm above the ground. The position of the feet was controlled relative to the load such that the horizontal distance from the hand to the ankle at the start of extension was either 20, 40, or 60 cm. Subjects performed 20 trials in each of six combinations of load and ankle-load distance chosen to provide three sets of equivilent load moment pairs. The initial horizontal distance from the load to the ankle had a large influence on the posture adopted to lift the load. Ankle and knee flexion, in particular, were reduced when the ankle-load distance was smaller, and particularly so when the distance was reduced to 20 cm. Hip flexion was reduced to a smaller extent, while lumbar vertebral flexion remained relatively unchanged. The inclination of the trunk at the start of the lift was unchanged when the ankle-load distance was 60 or 40 cm, but was 10 degrees greater when the load was 20 cm from the ankles, indicating that subjects adopted a posture closer to a stoop when the ankle-load distance was small. Comparison of conditions of equal load moment (but different load mass and ankle-load distance) revealed differences which mirrored the effects of ankle-load distance alone, suggesting that the effects of ankle-load distance on the posture adopted at the start of extension were largely independent of the load moment. While the forces and torques required to lift a load must be to some extent dependent on the load moment, rather than load or ankle-load distance per se, the posture adopted to lift the load is not.

Effects of egg load on the host-selection behaviour of Helicoverpa armigera (Hubner) (Lepidoptera : Noctuidae)

We examined the effect of age-specific fecundity, mated status, and egg load on host-plant selection, by Helicoverpa armigera under laboratory conditions. The physiological state of a female moth (number of mature eggs produced) greatly influences her host-plant specificity and propensity to oviposit (oviposition motivation). Female moths were less discriminating against cowpea (a low-ranked host) relative to maize (a high-ranked host) as egg load increased. Similarly, increased egg load led to a greater propensity to oviposit on both cowpea and maize. Distribution of oviposition with age of mated females peaked shortly after mating and declined steadily thereafter until death. Most mated females (88%) carried only a single spermatophore, a few females (12%) contained two. The significance of these findings in relation to host-plant selection by H. armigera, and its management, are discussed.

A consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements

To translate and transfer solution data between two totally different meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has the following significant advantages: (1) The use of a point-searching strategy allows a point in one mesh to be accurately related to an element (containing this point) in another mesh. Thus, to translate/transfer the solution of any particular point from mesh 2 td mesh 1, only one element in mesh 2 needs to be inversely mapped. This certainly minimizes the number of elements, to which the inverse mapping is applied. In this regard, the present algorithm is very effective and efficient. (2) Analytical solutions to the local co ordinates of any point in a four-node quadrilateral element, which are derived in a rigorous mathematical manner in the context of this paper, make it possible to carry out an inverse mapping process very effectively and efficiently. (3) The use of consistent interpolation enables the interpolated solution to be compatible with an original solution and, therefore guarantees the interpolated solution of extremely high accuracy. After the mathematical formulations of the algorithm are presented, the algorithm is tested and validated through a challenging problem. The related results from the test problem have demonstrated the generality, accuracy, effectiveness, efficiency and robustness of the proposed consistent point-searching algorithm. Copyright (C) 1999 John Wiley & Sons, Ltd.

Trial-of-antibiotic algorithm for the diagnosis of tuberculosis in a district hospital in a developing country with high HIV prevalence

OBJECTIVE: To evaluate a diagnostic algorithm for pulmonary tuberculosis based on smear microscopy and objective response to trial of antibiotics. SETTING: Adult medical wards, Hlabisa Hospital, South Africa, 1996-1997. METHODS: Adults with chronic chest symptoms and abnormal chest X-ray had sputum examined for Ziehl-Neelsen stained acid-fast bacilli by light microscopy. Those with negative smears were treated with amoxycillin for 5 days and assessed. Those who had not improved were treated with erythromycin for 5 days and reassessed. Response was compared with mycobacterial culture. RESULTS: Of 280 suspects who completed the diagnostic pathway, 160 (57%) had a positive smear, 46 (17%) responded to amoxycillin, 34 (12%) responded to erythromycin and 40 (14%) were treated as smear-negative tuberculosis. The sensitivity (89%) and specificity (84%) of the full algorithm for culture-positive tuberculosis were high. However, 11 patients (positive predictive value [PPV] 95%) were incorrectly diagnosed with tuberculosis, and 24 cases of tuberculosis (negative predictive value [NPV] 70%) were not identified. NPV improved to 75% when anaemia was included as a predictor. Algorithm performance was independent of human immunodeficiency virus status. CONCLUSION: Sputum smear microscopy plus trial of antibiotic algorithm among a selected group of tuberculosis suspects may increase diagnostic accuracy in district hospitals in developing countries.

Minimum-order stable recursive filter design via the genetic algorithm approach

In this paper, the minimum-order stable recursive filter design problem is proposed and investigated. This problem is playing an important role in pipeline implementation sin signal processing. Here, the existence of a high-order stable recursive filter is proved theoretically, in which the upper bound for the highest order of stable filters is given. Then the minimum-order stable linear predictor is obtained via solving an optimization problem. In this paper, the popular genetic algorithm approach is adopted since it is a heuristic probabilistic optimization technique and has been widely used in engineering designs. Finally, an illustrative example is sued to show the effectiveness of the proposed algorithm.