281,367 research outputs found

    Particle swarm optimization with composite particles in dynamic environments

    Get PDF
    This article is placed here with the permission of IEEE - Copyright @ 2010 IEEEIn recent years, there has been a growing interest in the study of particle swarm optimization (PSO) in dynamic environments. This paper presents a new PSO model, called PSO with composite particles (PSO-CP), to address dynamic optimization problems. PSO-CP partitions the swarm into a set of composite particles based on their similarity using a "worst first" principle. Inspired by the composite particle phenomenon in physics, the elementary members in each composite particle interact via a velocity-anisotropic reflection scheme to integrate valuable information for effectively and rapidly finding the promising optima in the search space. Each composite particle maintains the diversity by a scattering operator. In addition, an integral movement strategy is introduced to promote the swarm diversity. Experiments on a typical dynamic test benchmark problem provide a guideline for setting the involved parameters and show that PSO-CP is efficient in comparison with several state-of-the-art PSO algorithms for dynamic optimization problems.This work was supported in part by the Key Program of the National Natural Science Foundation (NNSF) of China under Grant 70931001 and 70771021, the Science Fund for Creative Research Group of the NNSF of China under Grant 60821063 and 70721001, the Ph.D. Programs Foundation of the Ministry of education of China under Grant 200801450008, and by the Engineering and Physical Sciences Research Council of U.K. under Grant EP/E060722/1

    Reverse Line Graph Construction: The Matrix Relabeling Algorithm MARINLINGA Versus Roussopoulos's Algorithm

    Full text link
    We propose a new algorithm MARINLINGA for reverse line graph computation, i.e., constructing the original graph from a given line graph. Based on the completely new and simpler principle of link relabeling and endnode recognition, MARINLINGA does not rely on Whitney's theorem while all previous algorithms do. MARINLINGA has a worst case complexity of O(N^2), where N denotes the number of nodes of the line graph. We demonstrate that MARINLINGA is more time-efficient compared to Roussopoulos's algorithm, which is well-known for its efficiency.Comment: 30 pages, 24 figure

    Control and dynamics of a flexible spacecraft during stationkeeping maneuvers

    Get PDF
    A case study of a spacecraft having flexible solar arrays is presented. A stationkeeping attitude control mode using both earth and rate gyro reference signals and a flexible vehicle dynamics modeling and implementation is discussed. The control system is designed to achieve both pointing accuracy and structural mode stability during stationkeeping maneuvers. Reduction of structural mode interactions over the entire mode duration is presented. The control mode using a discrete time observer structure is described to show the convergence of the spacecraft attitude transients during Delta-V thrusting maneuvers without preloading thrusting bias to the onboard control processor. The simulation performance using the three axis, body stabilized nonlinear dynamics is provided. The details of a five body dynamics model are discussed. The spacecraft is modeled as a central rigid body having cantilevered flexible antennas, a pair of flexible articulated solar arrays, and to gimballed momentum wheels. The vehicle is free to undergo unrestricted rotations and translations relative to inertial space. A direct implementation of the equations of motion is compared to an indirect implementation that uses a symbolic manipulation software to generate rigid body equations

    Modelling South African Currency Crises as Structural Changes in the Volatility of the Rand

    Get PDF
    This study tests the theory that currency crises are associated with sudden large changes in the structure of foreign exchange market volatility. Due to increases in market uncertainty, crisis periods exhibit abnormally high levels of volatility. By studying short-term changes in volatility dynamics, it is possible to identify the start- and end-dates of crisis periods with a high degree of precision. We use the iterative cumulative sum of squares algorithm to detect multiple shifts in the volatility of rand returns between January 1994 and March 2009. Dummy variables controlling for the detected shifts in variance are incorporated in a GARCH modelling framework. The analysis indicates that previously identified crisis periods in the rand coincide with significant structural changes in market volatility.Currency crisis, exchange rate, volatility, ICSS algorithm, GARCH

    Hardcore bosons on checkerboard lattices near half filling: geometric frustration, vanishing charge order and fractional phase

    Full text link
    We study a spinless hardcore boson model on checkerboard lattices by Green function Monte Carlo method. At half filling, the ground state energy is obtained up to 28×2828\times 28 lattice and extrapolated to infinite size, the staggered pseudospin magnetization is found to vanish in the thermodynamic limit. Thus the (π,π)(\pi,\pi) charge order is absent in this system. Away from half filling, two defects induced by each hole (particle) may carry fractional charge (±e/2\pm e/2). For one hole case, we study how the defect-defect correlation changes with t/Jt/J, which is the ratio between the hopping integral and cyclic exchange, equals to V/2tV/2t when VtV\gg t. Moreover, we argue that these fractional defects may propagate independently when the concentration of holes (or defects) is large enough
    corecore