Asymmetric vortex solitons in nonlinear periodic lattices

We reveal the existence of asymmetric vortex solitons in ideally symmetric periodic lattices, and show how such nonlinear localized structures describing elementary circular flows can be analyzed systematically using the energy-balance relations. We present the examples of rhomboid, rectangular, and triangular vortex solitons on a square lattice, and also describe novel coherent states where the populations of clockwise and anti-clockwise vortex modes change periodically due to a nonlinearity-induced momentum exchange through the lattice. Asymmetric vortex solitons are expected to exist in different nonlinear lattice systems including optically-induced photonic lattices, nonlinear photonic crystals, and Bose-Einstein condensates in optical lattices.Comment: 4 pages, 5 figure

Ant colony optimization with immigrants schemes in dynamic environments

This is the post-print version of this article. The official published version can be accessed from the link below - Copyright @ 2010 Springer-VerlagIn recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been developed for EAs to increase the diversity of the population and enhance the performance of the algorithm for DOPs. Among these approaches, immigrants schemes have been found beneficial for EAs for DOPs. In this paper, random, elitismbased, and hybrid immigrants schemes are applied to ant colony optimization (ACO) for the dynamic travelling salesman problem (DTSP). The experimental results show that random immigrants are beneficial for ACO in fast changing environments, whereas elitism-based immigrants are beneficial for ACO in slowly changing environments. The ACO algorithm with hybrid immigrants scheme combines the merits of the random and elitism-based immigrants schemes. Moreover, the results show that the proposed algorithms outperform compared approaches in almost all dynamic test cases and that immigrant schemes efficiently improve the performance of ACO algorithms in DTSP.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1

ETEA: A euclidean minimum spanning tree-Based evolutionary algorithm for multiobjective optimization

© the Massachusetts Institute of TechnologyAbstract The Euclidean minimum spanning tree (EMST), widely used in a variety of domains, is a minimum spanning tree of a set of points in the space, where the edge weight between each pair of points is their Euclidean distance. Since the generation of an EMST is entirely determined by the Euclidean distance between solutions (points), the properties of EMSTs have a close relation with the distribution and position information of solutions. This paper explores the properties of EMSTs and proposes an EMST-based Evolutionary Algorithm (ETEA) to solve multiobjective optimization problems (MOPs). Unlike most EMO algorithms that focus on the Pareto dominance relation, the proposed algorithm mainly considers distance-based measures to evaluate and compare individuals during the evolutionary search. Specifically in ETEA, four strategies are introduced: 1) An EMST-based crowding distance (ETCD) is presented to estimate the density of individuals in the population; 2) A distance comparison approach incorporating ETCD is used to assign the fitness value for individuals; 3) A fitness adjustment technique is designed to avoid the partial overcrowding in environmental selection; 4) Three diversity indicators-the minimum edge, degree, and ETCD-with regard to EMSTs are applied to determine the survival of individuals in archive truncation. From a series of extensive experiments on 32 test instances with different characteristics, ETEA is found to be competitive against five state-of-the-art algorithms and its predecessor in providing a good balance among convergence, uniformity, and spread.Engineering and Physical Sciences Research Council (EPSRC) of the United Kingdom under Grant EP/K001310/1, and the National Natural Science Foundation of China under Grant 61070088

Maximal violation of Bell inequality for any given two-qubit pure state

In the case of bipartite two qubits systems, we derive the analytical expression of bound of Bell operator for any given pure state. Our result not only manifest some properties of Bell inequality, for example which may be violated by any pure entangled state and only be maximally violated for a maximally entangled state, but also give the explicit values of maximal violation for any pure state. Finally we point out that for two qubits systems there is no mixed state which can produce maximal violation of Bell inequality.Comment: 3 pages, 1 figure

Towards A Background Independent Quantum Gravity

We recapitulate the scheme of emergent gravity to highlight how a background independent quantum gravity can be defined by quantizing spacetime itself.Comment: 25 pages, 2 figures, Proceedings of 7th International Conference "Quantum Theory and Symmetries" (QTS-7) in Prague, Czech Republic, August, 201