164 research outputs found

    GREEN-PSO: Conserving Function Evaluations in Particle Swarm Optimization

    Get PDF
    particle swarm optimization; swarm intelligence. In the Particle Swarm Optimization (PSO) algorithm, the expense of evaluating the objective function can make it difficult, or impossible, to use this approach effectively; reducing the number of necessary function evaluations would make it possible to apply the PSO algorithm more widely. Many function approximation techniques have been developed that address this issue, but an alternative to function approximation is function conservation. We describe GREEN-PSO (GR-PSO), an algorithm that, given a fixed number of function evaluations, conserves those function evaluations by probabilistically choosing a subset of particles smaller than the entire swarm on each iteration and allowing only those particles to perform function evaluations. The “surplus ” of function evaluations thus created allows a greater number of particles and/or iterations. In spite of the loss of information resulting from this more parsimonious use of function evaluations, GR-PSO performs as well as, or better than, the standard PSO algorithm on a set of six benchmark functions, both in terms of the rate of error reduction and the quality of the final solution.

    Initial Experiments in Using Communication Swarms to Improve the Performance of Swarm Systems

    Get PDF
    Abstract. Swarm intelligence can provide robust, adaptable, scalable solutions to difficult problems. The distributed nature of swarm activity is the basis of these desirable qualities, but it also prevents swarm-based techniques from having direct access to global knowledge that could facilitate the task at hand. Our experiments indicate that a swarm system can use an auxiliary swarm, called a communication swarm, to create and distribute an approximation of useful global knowledge, without sacrificing robustness, adaptability, and scalability. We describe a communication swarm and validate its effectiveness on a simple problem.

    The other world of Mark Twain: dreams and reality in his works

    Get PDF
    The development of an escape mechanism follows a pattern based on Twain\u27s ever-changing philosophy of life. This philosophy moved from a view of life as idyllic, through various stages, to a refusal to accept the unbeatable evils of life by refusing to accept their reality. The pattern itself is tracaeable in the development of Twain\u27s writings

    Contingent planning under uncertainty via stochastic satisfiability

    Get PDF
    We describe a new planning technique that efficiently solves probabilistic propositional contingent planning problems by converting them into instances of stochastic satisfiability (SSAT) and solving these problems instead. We make fundamental contributions in two areas: the solution of SSAT problems and the solution of stochastic planning problems. This is the first work extending the planning-as-satisfiability paradigm to stochastic domains. Our planner, ZANDER, can solve arbitrary, goal-oriented, finite-horizon partially observable Markov decision processes (POMDPs). An empirical study comparing ZANDER to seven other leading planners shows that its performance is competitive on a range of problems. © 2003 Elsevier Science B.V. All rights reserved

    Steady state particle swarm

    Get PDF
    The following grant information was disclosed by the authors: Fundação para a Ciência e Tecnologia (FCT), Research Fellowship: SFRH/BPD/66876/2009. FCT PROJECT: UID/EEA/50009/2013. EPHEMECH: TIN2014-56494-C4-3-P, Spanish Ministry of Economy and Competitivity. PROY-PP2015-06: Plan Propio 2015 UGR. CEI2015-MP-V17 of the Microprojects program 2015 from CEI BioTIC Granada.This paper investigates the performance and scalability of a new update strategy for the particle swarm optimization (PSO) algorithm. The strategy is inspired by the Bak–Sneppen model of co-evolution between interacting species, which is basically a network of fitness values (representing species) that change over time according to a simple rule: the least fit species and its neighbors are iteratively replaced with random values. Following these guidelines, a steady state and dynamic update strategy for PSO algorithms is proposed: only the least fit particle and its neighbors are updated and evaluated in each time-step; the remaining particles maintain the same position and fitness, unless they meet the update criterion. The steady state PSO was tested on a set of unimodal, multimodal, noisy and rotated benchmark functions, significantly improving the quality of results and convergence speed of the standard PSOs and more sophisticated PSOs with dynamic parameters and neighborhood. A sensitivity analysis of the parameters confirms the performance enhancement with different parameter settings and scalability tests show that the algorithm behavior is consistent throughout a substantial range of solution vector dimensions.This work was supported by Fundação para a Ciência e Tecnologia (FCT) Research Fellowship SFRH/BPD/66876/2009 and FCT Project (UID/EEA/50009/2013), EPHEMECH (TIN2014-56494-C4-3-P, Spanish Ministry of Economy and Competitivity), PROY-PP2015-06 (Plan Propio 2015 UGR), project CEI2015-MP-V17 of the Microprojects program 2015 from CEI BioTIC Granada

    Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems with Applications to Probabilistic State Reachability and Region Stability

    Full text link
    The stochastic Boolean satisfiability (SSAT) problem has been introduced by Papadimitriou in 1985 when adding a probabilistic model of uncertainty to propositional satisfiability through randomized quantification. SSAT has many applications, among them probabilistic bounded model checking (PBMC) of symbolically represented Markov decision processes. This article identifies a notion of Craig interpolant for the SSAT framework and develops an algorithm for computing such interpolants based on a resolution calculus for SSAT. As a potential application area of this novel concept of Craig interpolation, we address the symbolic analysis of probabilistic systems. We first investigate the use of interpolation in probabilistic state reachability analysis, turning the falsification procedure employing PBMC into a verification technique for probabilistic safety properties. We furthermore propose an interpolation-based approach to probabilistic region stability, being able to verify that the probability of stabilizing within some region is sufficiently large

    The American Association for the Surgery of Trauma renal injury grading scale: Implications of the 2018 revisions for injury reclassification and predicting bleeding interventions.

    Get PDF
    BackgroundIn 2018, the American Association for the Surgery of Trauma (AAST) published revisions to the renal injury grading system to reflect the increased reliance on computed tomography scans and non-operative management of high-grade renal trauma (HGRT). We aimed to evaluate how these revisions will change the grading of HGRT and if it outperforms the original 1989 grading in predicting bleeding control interventions.MethodsData on HGRT were collected from 14 Level-1 trauma centers from 2014 to 2017. Patients with initial computed tomography scans were included. Two radiologists reviewed the scans to regrade the injuries according to the 1989 and 2018 AAST grading systems. Descriptive statistics were used to assess grade reclassifications. Mixed-effect multivariable logistic regression was used to measure the predictive ability of each grading system. The areas under the curves were compared.ResultsOf the 322 injuries included, 27.0% were upgraded, 3.4% were downgraded, and 69.5% remained unchanged. Of the injuries graded as III or lower using the 1989 AAST, 33.5% were upgraded to grade IV using the 2018 AAST. Of the grade V injuries, 58.8% were downgraded using the 2018 AAST. There was no statistically significant difference in the overall areas under the curves between the 2018 and 1989 AAST grading system for predicting bleeding interventions (0.72 vs. 0.68, p = 0.34).ConclusionAbout one third of the injuries previously classified as grade III will be upgraded to grade IV using the 2018 AAST, which adds to the heterogeneity of grade IV injuries. Although the 2018 AAST grading provides more anatomic details on injury patterns and includes important radiologic findings, it did not outperform the 1989 AAST grading in predicting bleeding interventions.Level of evidencePrognostic and Epidemiological Study, level III
    corecore