Memory-based immigrants for ant colony optimization in changing environments

Copyright @ 2011 SpringerAnt colony optimization (ACO) algorithms have proved that they can adapt to dynamic optimization problems (DOPs) when they are enhanced to maintain diversity. DOPs are important due to their similarities to many real-world applications. Several approaches have been integrated with ACO to improve their performance in DOPs, where memory-based approaches and immigrants schemes have shown good results on different variations of the dynamic travelling salesman problem (DTSP). In this paper, we consider a novel variation of DTSP where traffic jams occur in a cyclic pattern. This means that old environments will re-appear in the future. A hybrid method that combines memory and immigrants schemes is proposed into ACO to address this kind of DTSPs. The memory-based approach is useful to directly move the population to promising areas in the new environment by using solutions stored in the memory. The immigrants scheme is useful to maintain the diversity within the population. The experimental results based on different test cases of the DTSP show that the memory based immigrants scheme enhances the performance of ACO in cyclic dynamic environments.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/2

Experiments with a machine-centric approach to realise distributed emergent software systems

Modern distributed systems are exposed to constant changes in their operating environment, leading to high uncertainty. Self-adaptive and self-organising approaches have become a popular solution for runtime reactivity to this uncertainty. However, these approaches use predefined, expertly-crafted policies or models, constructed at design-time, to guide system (re)configuration. They are human-centric, making modelling or policy-writing difficult to scale to increasingly complex systems; and are inflexible in their ability to deal with the unexpected at runtime (e.g. conditions not captured in a policy). We argue for a machine-centric approach to this problem, in which the desired behaviour is autonomously learned and emerges at runtime from a large pool of small alternative components, as a continuous reaction to the observed behaviour of the software and the characteristics of its operating environment. We demonstrate our principles in the context of data-centre software, showing that our approach is able to autonomously coordinate a distributed infrastructure composed of emergent web servers and a load balancer. Our initial results validate our approach, showing autonomous convergence on an optimal configuration, and also highlight the open challenges in providing fully machine-led distributed emergent software systems

Hemisphere Mixing: a Fully Data-Driven Model of QCD Multijet Backgrounds for LHC Searches

A novel method is proposed here to precisely model the multi-dimensional features of QCD multi-jet events in hadron collisions. The method relies on the schematization of high-pT QCD processes as 2->2 reactions made complex by sub-leading effects. The construction of libraries of hemispheres from experimental data and the definition of a suitable nearest-neighbor-based association map allow for the generation of artificial events that reproduce with surprising accuracy the kinematics of the QCD component of original data, while remaining insensitive to small signal contaminations. The method is succinctly described and its performance is tested in the case of the search for the hh->bbbb process at the LHC.Comment: 4 pages plus header, 1 figure, proceedings of EPS 2017 Venic

Vector bundles on the projective line and finite domination of chain complexes

Finitely dominated chain complexes over a Laurent polynomial ring in one indeterminate are characterised by vanishing of their Novikov homology. We present an algebro-geometric approach to this result, based on extension of chain complexes to sheaves on the projective line. We also discuss the K-theoretical obstruction to extension.Comment: v1: 11 page

Solving Optimization Problems by the Public Goods Game

This document is the Accepted Manuscript version of the following article: Marco Alberto Javarone, ‘Solving optimization problems by the public goods game’, The European Physical Journal B, 90:17, September 2017. Under embargo. Embargo end date: 18 September 2018. The final, published version is available online at doi: https://doi.org/10.1140/epjb/e2017-80346-6. Published by Springer Berlin Heidelberg.We introduce a method based on the Public Goods Game for solving optimization tasks. In particular, we focus on the Traveling Salesman Problem, i.e. a NP-hard problem whose search space exponentially grows increasing the number of cities. The proposed method considers a population whose agents are provided with a random solution to the given problem. In doing so, agents interact by playing the Public Goods Game using the fitness of their solution as currency of the game. Notably, agents with better solutions provide higher contributions, while those with lower ones tend to imitate the solution of richer agents for increasing their fitness. Numerical simulations show that the proposed method allows to compute exact solutions, and suboptimal ones, in the considered search spaces. As result, beyond to propose a new heuristic for combinatorial optimization problems, our work aims to highlight the potentiality of evolutionary game theory beyond its current horizons.Peer reviewedFinal Accepted Versio

Ant colony optimisation and local search for bin-packing and cutting stock problems

The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for real-world problems, we have to rely on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to these problems, including Genetic Algorithms and Evolutionary Programming. In the work presented here, we used an ant colony optimization (ACO) approach to solve both Bin Packing and Cutting Stock Problems. We present a pure ACO approach, as well as an ACO approach augmented with a simple but very effective local search algorithm. It is shown that the pure ACO approach can compete with existing evolutionary methods, whereas the hybrid approach can outperform the best-known hybrid evolutionary solution methods for certain problem classes. The hybrid ACO approach is also shown to require different parameter values from the pure ACO approach and to give a more robust performance across different problems with a single set of parameter values. The local search algorithm is also run with random restarts and shown to perform significantly worse than when combined with ACO

DeepSwarm : Optimising Convolutional Neural Networks using Swarm Intelligence

Postprin

Analytical parametrization and shape classification of anomalous HH production in the EFT approach

20 pages, 10 figures, LHC Higgs Cross Section Working Group report http://cds.cern.ch/record/2199287In this document we study the effect of anomalous Higgs boson couplings on non-resonant pair production of Higgs bosons ($HH$) at the LHC. We explore the space of the five parameters $\kappa_{\lambda}$, $\kappa_{t}$, $c_2$, $c_g$, and $c_{2g}$ in terms of the corresponding kinematics of the final state, and describe a partition of the space into a limited number of regions featuring similar phenomenology in the kinematics of $HH$ final state. We call clusters the sets of points belonging to the same region; to each cluster corresponds a representative point which we call a benchmark. We discuss a possible technique to estimate the sensitivity of an experimental search to the kinematical differences between the phenomenology of the benchmark points and the rest of the parameter space contained in the corresponding cluster. We also provide an analytical parametrization of the cross-section modifications that the variation of anomalous couplings produces with respect to standard model $HH$ production along with a recipe to translate the results into other parameter-space bases. Finally, we provide a preliminary analysis of variations in the topology of the final state within each region based on recent LHC results

Neuronal assembly dynamics in supervised and unsupervised learning scenarios

The dynamic formation of groups of neurons—neuronal assemblies—is believed to mediate cognitive phenomena at many levels, but their detailed operation and mechanisms of interaction are still to be uncovered. One hypothesis suggests that synchronized oscillations underpin their formation and functioning, with a focus on the temporal structure of neuronal signals. In this context, we investigate neuronal assembly dynamics in two complementary scenarios: the first, a supervised spike pattern classification task, in which noisy variations of a collection of spikes have to be correctly labeled; the second, an unsupervised, minimally cognitive evolutionary robotics tasks, in which an evolved agent has to cope with multiple, possibly conflicting, objectives. In both cases, the more traditional dynamical analysis of the system’s variables is paired with information-theoretic techniques in order to get a broader picture of the ongoing interactions with and within the network. The neural network model is inspired by the Kuramoto model of coupled phase oscillators and allows one to fine-tune the network synchronization dynamics and assembly configuration. The experiments explore the computational power, redundancy, and generalization capability of neuronal circuits, demonstrating that performance depends nonlinearly on the number of assemblies and neurons in the network and showing that the framework can be exploited to generate minimally cognitive behaviors, with dynamic assembly formation accounting for varying degrees of stimuli modulation of the sensorimotor interactions