Search results for "Parallel"
showing 10 items of 667 documents
General Concepts in Metaheuristic Search
2017
Metaheuristics have become a very popular family of solution methods for optimization problems because they are capable of finding “acceptable” solutions in a “reasonable” amount of time. Most optimization problems in practice are too complex to be approached by exact methods that can guarantee finding global optimal solutions. The time required to find and verify globally optimal solutions is impractical in most applications. An entire computational theory, which we will not discussed here, has been developed around problem complexity. It suffices to say that it is now known that the great majority of the optimization problems found in practice fall within a category that makes them “compu…
Relaxed Stability and Performance LMI Conditions for Takagi-Sugeno Fuzzy Systems With Polynomial Constraints on Membership Function Shapes
2008
Most linear matrix inequality (LMI) fuzzy control results in literature are valid for any membership function, i.e., independent of the actual membership shape. Hence, they are conservative (with respect to other nonlinear control approaches) when specific knowledge of the shapes is available. This paper presents relaxed LMI conditions for fuzzy control that incorporate such shape information in the form of polynomial constraints, generalizing previous works by the authors. Interesting particular cases are overlap (product) bounds and ellipsoidal regions. Numerical examples illustrate the achieved improvements, as well as the possibilities of solving some multiobjective problems. The result…
Anti-tempered Layered Adaptive Importance Sampling
2017
Monte Carlo (MC) methods are widely used for Bayesian inference in signal processing, machine learning and statistics. In this work, we introduce an adaptive importance sampler which mixes together the benefits of the Importance Sampling (IS) and Markov Chain Monte Carlo (MCMC) approaches. Different parallel MCMC chains provide the location parameters of the proposal probability density functions (pdfs) used in an IS method. The MCMC algorithms consider a tempered version of the posterior distribution as invariant density. We also provide an exhaustive theoretical support explaining why, in the presented technique, even an anti-tempering strategy (reducing the scaling of the posterior) can …
Parallel Simulated Annealing: Getting Super Linear Speedups
2005
The study described in this paper tries to improve and combine different approaches that are able to speed up applications of the Simulated Annealing model. It investigates separately two main aspects concerning the degree of parallelism an implementation can egectively exploit at the initial andfinal periods of an execution. As for case studies, it deals with two implementations: the Job shop Scheduling problem and the poryblio selection problem. The paper reports the results of a large number of experiments, carried out by means of a transputer network and a hypercube system. They give useful suggestions about selecting the most suitable values of the intervention parameters to achieve su…
Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
2015
International audience; Embedded systems have become an essential part of our lives, thanks to their evolution in the recent years, but the main drawback is their power consumption. This paper is focused on improving the memory allocation of embedded systems to reduce their power consumption. We propose a parallel variable neighborhood search algorithm for the dynamic memory allocation problem, and compare it with the state of the art. Computational results and statistical tests applied show that the proposed algorithm produces significantly better outcomes than the previous algorithm in shorter computing time.
The X-Ray Transform for Connections in Negative Curvature
2016
We consider integral geometry inverse problems for unitary connections and skew-Hermitian Higgs fields on manifolds with negative sectional curvature. The results apply to manifolds in any dimension, with or without boundary, and also in the presence of trapped geodesics. In the boundary case, we show injectivity of the attenuated ray transform on tensor fields with values in a Hermitian bundle (i.e. vector valued case). We also show that a connection and Higgs field on a Hermitian bundle are determined up to gauge by the knowledge of the parallel transport between boundary points along all possible geodesics. The main tools are an energy identity, the Pestov identity with a unitary connect…
On the stability of flat complex vector bundles over parallelizable manifolds
2017
We investigate the flat holomorphic vector bundles over compact complex parallelizable manifolds $G / \Gamma$, where $G$ is a complex connected Lie group and $\Gamma$ is a cocompact lattice in it. The main result proved here is a structure theorem for flat holomorphic vector bundles $E_\rho$ associated to any irreducible representation $\rho : \Gamma \rightarrow \text{GL}(r,{\mathbb C})$. More precisely, we prove that $E_{\rho}$ is holomorphically isomorphic to a vector bundle of the form $E^{\oplus n}$, where $E$ is a stable vector bundle. All the rational Chern classes of $E$ vanish, in particular, its degree is zero. We deduce a stability result for flat holomorphic vector bundles $E_{\r…
A recurrence-free variant of strassen’s algorithm on hypercube
1995
In this paper a non-recursive Strassen’s matrix multiplication algorithm is presented. This new algorithm is suitable to run on parallel environments. Two computational schemes have been worked out exploiting different parallel approaches on hypercube architecture. A comparative analysis is reported. The experiments have been carried out on an nCUBE-2 supercomputer, housed at CNUCE in Pisa, supporting the Express parallel operating system. © 1995, Taylor & Francis Group, LLC. All rights reserved.
Pappus type theorems for motions along a submanifold
2004
Abstract We study the volumes volume( D ) of a domain D and volume( C ) of a hypersurface C obtained by a motion along a submanifold P of a space form M n λ . We show: (a) volume( D ) depends only on the second fundamental form of P , whereas volume( C ) depends on all the i th fundamental forms of P , (b) when the domain that we move D 0 has its q -centre of mass on P , volume( D ) does not depend on the mean curvature of P , (c) when D 0 is q -symmetric, volume( D ) depends only on the intrinsic curvature tensor of P ; and (d) if the image of P by the ln of the motion (in a sense which is well-defined) is not contained in a hyperplane of the Lie algebra of SO ( n − q − d ), and C …
Equilibrating Glassy Systems with Parallel Tempering
2001
We discuss the efficiency of the so-called parallel tempering method to equilibrate glassy systems also at low temperatures. The main focus is on two structural glass models, SiO2 and a Lennard-Jones system, but we also investigate a fully connected 10 state Potts-glass. By calculating the mean squared displacement of a tagged particle and the spin-autocorrelation function, we find that for these three glass-formers the parallel tempering method is indeed able to generate, at low temperatures, new independent configurations at a rate which is O(100) times faster than more traditional algorithms, such as molecular dynamics and single spin flip Monte Carlo dynamics. In addition we find that t…