Bayesian online algorithms for learning in discrete Hidden Markov Models

We propose and analyze two different Bayesian online algorithms for learning in discrete Hidden Markov Models and compare their performance with the already known Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence as a measure of generalization we draw learning curves in simplified situations for these algorithms and compare their performances.

Kinetic energy sum spectra in nonmesonic weak decay of hypernuclei

We evaluate the coincidence spectra in the nonmesonic weak decay (NMWD) Lambda N -> nN of Lambda hypernuclei (4)(Lambda)He, (5)(Lambda)He, (12)(Lambda)C, (16)(Lambda)O, and (28)(Lambda)Si, as a function of the sum of kinetic energies E(nN)=E(n)+E(N) for N=n,p. The strangeness-changing transition potential is described by the one-meson-exchange model, with commonly used parametrization. Two versions of the independent-particle shell model (IPSM) are employed to account for the nuclear structure of the final residual nuclei. They are as follows: (a) IPSM-a, where no correlation, except for the Pauli principle, is taken into account and (b) IPSM-b, where the highly excited hole states are considered to be quasistationary and are described by Breit-Wigner distributions, whose widths are estimated from the experimental data. All np and nn spectra exhibit a series of peaks in the energy interval 110 MeV < E(nN)< 170 MeV, one for each occupied shell-model state. Within the IPSM-a, and because of the recoil effect, each peak covers an energy interval proportional to A(-1) , going from congruent to 4 MeV for (28)(Lambda)Si to congruent to 40 MeV for (4)(Lambda)He. Such a description could be pretty fair for the light (4)(Lambda)He and (5)(Lambda)He hypernuclei. For the remaining, heavier, hypernuclei it is very important, however, to consider as well the spreading in strength of the deep-hole states and bring into play the IPSM-b approach. Notwithstanding the nuclear model that is employed the results depend only very weakly on the details of the dynamics involved in the decay process proper. We propose that the IPSM is the appropriate lowest-order approximation for the theoretical calculations of the of kinetic energy sum spectra in the NMWD. It is in comparison to this picture that one should appraise the effects of the final-state interactions and of the two-nucleon-induced decay mode.

Effect of weak dipolar interaction on the magnetic properties of Ni nanoparticles assembly analyzed with different protocols

The effect of weak dipolar interactions (DIs) between Ni nanoparticles (NPs) in samples with different Ni concentrations was investigated by performing a detailed characterization of their structural and magnetic properties. From the determination of several physical parameters of Ni NP assemblies, it was found that the ac and dc magnetic susceptibility measurements are valuable for identifying the DIs between NPs while hysteresis loops measurements showed to be very insensitive, provided that the strength of the DI field is much smaller than the maximum coercive field. Therefore, the sensitivity of the observed static and dynamical magnetic properties to the effect of weak DI depends on the measurement protocols used. (C) 2011 American Institute of Physics. [doi:10.1063/1.3556767]

Weak measurement: Effect of the detector dynamics

The contribution of the detector dynamics to the weak measurement is analyzed. According to the usual theory [Y. Aharonov, D. Z. Albert, and L. Vaidman, Phys. Rev. Lett. 60, 1351 (1988)] the outcome of a weak measurement with preselection and postselection can be expressed as the real part of a complex number: the weak value. By accounting for the Hamiltonian evolution of the detector, here we find that there is a contribution proportional to the imaginary part of the weak value to the outcome of the weak measurement. This is due to the coherence of the probe being essential for the concept of complex weak value to be meaningful. As a particular example, we consider the measurement of a spin component and find that the contribution of the imaginary part of the weak value is sizable.

GOOAL: A routine based on Genetic Algorithms to track harmonics in electric power systems

Voltage and current waveforms of a distribution or transmission power system are not pure sinusoids. There are distortions in these waveforms that can be represented as a combination of the fundamental frequency, harmonics and high frequency transients. This paper presents a novel approach to identifying harmonics in power system distorted waveforms. The proposed method is based on Genetic Algorithms, which is an optimization technique inspired by genetics and natural evolution. GOOAL, a specially designed intelligent algorithm for optimization problems, was successfully implemented and tested. Two kinds of representations concerning chromosomes are utilized: binary and real. The results show that the proposed method is more precise than the traditional Fourier Transform, especially considering the real representation of the chromosomes.

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

The bimolecular sensitization of nitric oxide release from weak interacting ruthenium units

This work reports on the bimolecular sensitization of nitric oxide release from cis-[Ru(bpy)(2)(iso)-NO](PF(6))(3) (1) (iso = isoquinoline and bpy = 2,2`- bipyridine) by irradiating the MLCT transition of the chloro analog cis-[Ru(bpy) 2(iso) Cl] PF6 (2). The compounds displayed peaks in the ESI-MS spectra at m/z 749.1 and m/z 578.1 ascribed, respectively, to ([1(NO(o))-2PF(6)center dot CH(3)OH](2+)) and ([2-PF(6)](+)). In the cyclic voltammograms, the nitrosyl complex presented two redox waves related to the NO ligand at 0.48 and -0.37 V (versus Ag/AgCl, NO(+/0/-1) processes), while the sensitizer showed two reversible waves at 0.79 and -1.46 V (versus Ag/AgCl, Ru(2+/3+) and bpy(0/-1), respectively). The most important feature of this system is that the nitrosyl compound does not have significant absorption in the visible region, while the sensitizer has an intense band centered at 496 nm. The irradiation of an equimolar mixture of the two compounds in an ethanol: water solution (v: v) with light of lambda > 500 nm leads to NO release, as probed by amperometric measurements. The variational method was applied, showing that the two compounds self-assembly in solution with a 1: 1 stoichiometry. Fluorescence spectra acquired at 77 K provided the E(0-0) for the system and, from the thermodynamic cycle it was estimated that the photoinduced electron transfer between the species has a Delta G value of -1.59 eV. (C) 2011 Elsevier B. V. All rights reserved.

Exploring weak interactions to assemble a nitrosyl-ruthenium compound able to release NO under visible light irradiation

This work reports oil a novel nitrosyl-ruthenium complex hearing the azanaphthalene ligand quinazoline (qui) ill its coordination sphere. The product crystallizes with ail additional quinazoline molecule, yielding the compound cis-[Ru(bpy)(2)(qui)NO](PF(6))(3).(qui). This feature leads to all absorption band at lambda(max) = 430 nm in CH(3)CN and lambda(max) = 420 nm in phosphate buffer, which promotes the photorelease of nitric oxide under visible light irradiation (lambda > 400 nm), in 1 ethanol: 1 water (v/v) mixture or under physiological pH. Both the intensity and energy of this transition are dependent on solvent and solution pH, suggesting that the transition has a charge transfer nature, and that the association of the second quinazoline molecule with the complex is driven by weak interactions, possibly of the pi-stacking type. (C) 2009 Elsevier Ltd. All rights reserved.