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.

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

Detection of the TLR4 1196C > T Polymorphism by Mismatched-Polymerase Chain Reaction Using Plasmid DNA as Internal Control in Restriction Fragment Length Polymorphism Assays

Background: Restriction fragment length polymorphism (RFLP) is a common molecular assay used for genotyping, and it requires validated quality control procedures to prevent mistyping caused by impaired endonuclease activity. We have evaluated the usefulness of a plasmid-based internal control in RFLP assays. Results: Blood samples were collected from 102 individuals with acute myocardial infarction (AMI) and 108 non-AMI individuals (controls) for DNA extraction and laboratory analyses. The 1196C> T polymorphism in the toll-like receptor 4 (TLR4) gene was amplified by mismatched-polymerase chain reaction (PCR). Amplicons and pBluescript II SK-plasmid were simultaneously digested with endonuclease HincII. Fragments were separated on 2% agarose gels. Plasmid was completely digested using up to 55.2 nmL/L DNA solutions and 1 mu L PCR product. Nevertheless, plasmid DNA with 41.4 nM or higher concentrations was incompletely digested in the presence of 7 mL PCR product. In standardized conditions, TLR4 1196C> T variant was accurately genotyped. TLR4 1196T allele frequency was similar between AMI (3.1%) and controls (2.0%, p = 0.948). TLR4 SNP was not associated with AMI in this sample population. In conclusion, the plasmid-based control is a useful approach to prevent mistyping in RFLP assays, and it is validate for genetic association studies such as TLR4 1196C> T.

Analysis of Liquid Crystalline Nanoparticles by Small Angle X-Ray Diffraction: Evaluation of Drug and Pharmaceutical Additives Influence on the Internal Structure

The goal of this work was to study the liquid crystalline structure of a nanodispersion delivery system intended to be used in photodynamic therapy after loading with photosensitizers (PSs) and additives such as preservatives and thickening polymers. Polarized light microscopy and light scattering were performed on a standard nanodispersion in order to determine the anisotropy of the liquid crystalline structure and the mean diameter of the nanoparticles, respectively. Small angle X-ray diffraction (SAXRD) was used to verify the influence of drug loading and additives on the liquid crystalline structure of the nanodispersions. The samples, before and after the addition of PSs and additives, were stable over 90 days, as verified by dynamic light scattering. SAXRD revealed that despite the alteration observed in some of the samples analyzed in the presence of photosensitizing drugs and additives, the hexagonal phase still remained in the crystalline phase. (C) 2011 Wiley-Liss, Inc. and the American Pharmacists Association J Pharm Sci 100: 2849-2857, 2011

Internal staircase, Carpenter Hall house, Wilston, Brisbane

As seen from lower level of house.

Roof structure internal, Raun Raun Theatre, Goroka

View of carved king post.

Roof structure, internal, PNG Coffee Industry Board Office and Warehouse, Goroka

View to underside of roof with steel beam and insulation.

Internal cladding to north-east facade, Mooloomba House, Point Lookout, North Stradbroke Island

View of internal cladding to north-east facade as seen from dining studio.

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.