63,072 research outputs found
An Experimental Study of Adaptive Control for Evolutionary Algorithms
The balance of exploration versus exploitation (EvE) is a key issue on
evolutionary computation. In this paper we will investigate how an adaptive
controller aimed to perform Operator Selection can be used to dynamically
manage the EvE balance required by the search, showing that the search
strategies determined by this control paradigm lead to an improvement of
solution quality found by the evolutionary algorithm
Local error estimates for adaptive simulation of the Reaction-Diffusion Master Equation via operator splitting
The efficiency of exact simulation methods for the reaction-diffusion master
equation (RDME) is severely limited by the large number of diffusion events if
the mesh is fine or if diffusion constants are large. Furthermore, inherent
properties of exact kinetic-Monte Carlo simulation methods limit the efficiency
of parallel implementations. Several approximate and hybrid methods have
appeared that enable more efficient simulation of the RDME. A common feature to
most of them is that they rely on splitting the system into its reaction and
diffusion parts and updating them sequentially over a discrete timestep. This
use of operator splitting enables more efficient simulation but it comes at the
price of a temporal discretization error that depends on the size of the
timestep. So far, existing methods have not attempted to estimate or control
this error in a systematic manner. This makes the solvers hard to use for
practitioners since they must guess an appropriate timestep. It also makes the
solvers potentially less efficient than if the timesteps are adapted to control
the error. Here, we derive estimates of the local error and propose a strategy
to adaptively select the timestep when the RDME is simulated via a first order
operator splitting. While the strategy is general and applicable to a wide
range of approximate and hybrid methods, we exemplify it here by extending a
previously published approximate method, the Diffusive Finite-State Projection
(DFSP) method, to incorporate temporal adaptivity
Fast adaptive elliptical filtering using box splines
We demonstrate that it is possible to filter an image with an elliptic window
of varying size, elongation and orientation with a fixed computational cost per
pixel. Our method involves the application of a suitable global pre-integrator
followed by a pointwise-adaptive localization mesh. We present the basic theory
for the 1D case using a B-spline formalism and then appropriately extend it to
2D using radially-uniform box splines. The size and ellipticity of these
radially-uniform box splines is adaptively controlled. Moreover, they converge
to Gaussians as the order increases. Finally, we present a fast and practical
directional filtering algorithm that has the capability of adapting to the
local image features.Comment: 9 pages, 1 figur
Coherent control using adaptive learning algorithms
We have constructed an automated learning apparatus to control quantum
systems. By directing intense shaped ultrafast laser pulses into a variety of
samples and using a measurement of the system as a feedback signal, we are able
to reshape the laser pulses to direct the system into a desired state. The
feedback signal is the input to an adaptive learning algorithm. This algorithm
programs a computer-controlled, acousto-optic modulator pulse shaper. The
learning algorithm generates new shaped laser pulses based on the success of
previous pulses in achieving a predetermined goal.Comment: 19 pages (including 14 figures), REVTeX 3.1, updated conten
An Inter-molecular Adaptive Collision Scheme for Chemical Reaction Optimization
Optimization techniques are frequently applied in science and engineering
research and development. Evolutionary algorithms, as a kind of general-purpose
metaheuristic, have been shown to be very effective in solving a wide range of
optimization problems. A recently proposed chemical-reaction-inspired
metaheuristic, Chemical Reaction Optimization (CRO), has been applied to solve
many global optimization problems. However, the functionality of the
inter-molecular ineffective collision operator in the canonical CRO design
overlaps that of the on-wall ineffective collision operator, which can
potential impair the overall performance. In this paper we propose a new
inter-molecular ineffective collision operator for CRO for global optimization.
To fully utilize our newly proposed operator, we also design a scheme to adapt
the algorithm to optimization problems with different search space
characteristics. We analyze the performance of our proposed algorithm with a
number of widely used benchmark functions. The simulation results indicate that
the new algorithm has superior performance over the canonical CRO
MADNESS: A Multiresolution, Adaptive Numerical Environment for Scientific Simulation
MADNESS (multiresolution adaptive numerical environment for scientific
simulation) is a high-level software environment for solving integral and
differential equations in many dimensions that uses adaptive and fast harmonic
analysis methods with guaranteed precision based on multiresolution analysis
and separated representations. Underpinning the numerical capabilities is a
powerful petascale parallel programming environment that aims to increase both
programmer productivity and code scalability. This paper describes the features
and capabilities of MADNESS and briefly discusses some current applications in
chemistry and several areas of physics
- …