We analyze the so called swapping algorithm, a parallel version of the well-known Metropolis-Hastings algorithm, on the mean-field version of the Blume-Emery-Griffiths model in statistical mechanics. This model has tw...
详细信息
We analyze the so called swapping algorithm, a parallel version of the well-known Metropolis-Hastings algorithm, on the mean-field version of the Blume-Emery-Griffiths model in statistical mechanics. This model has two parameters and depending on their choice, the model exhibits either a first, or a second order phase transition. In agreement with a conjecture by Bhatnagar and Randall we find that the swapping algorithm mixes rapidly in presence of a second order phase transition, while becoming slow when the phase transition is first order. (c) 2012 Wiley Periodicals, Inc. Random Struct. Alg., 45, 38-77, 2014
Many classical synchronization problems such as the assembly line crew scheduling problem (ALCS), some data association problems or multisensor tracking problems can be formulated as finding intra-column rearrangement...
详细信息
Many classical synchronization problems such as the assembly line crew scheduling problem (ALCS), some data association problems or multisensor tracking problems can be formulated as finding intra-column rearrangements for a single matrix repre-senting costs, distances, similarities or time requirements. In this paper, we consider an extension of these problems to the case of multiple matrices, reflecting various possible instances (scenarios). To approximate optimal rearrangements, we introduce the Block swapping algorithm (BSA) and a further customization of it that we call the customized Block swapping algorithm (Cust BSA). A numerical study shows that the two algorithms we propose - in particular Cust BSA - yield high-quality solutions and also deal efficiently with high-dimensional set-ups. (C) 2021 Elsevier B.V. All rights reserved.
The Wasserstein barycenter is an important notion in the analysis of high dimensional data with a broad range of applications in applied probability, economics, statistics, and in particular to clustering and image pr...
详细信息
The Wasserstein barycenter is an important notion in the analysis of high dimensional data with a broad range of applications in applied probability, economics, statistics, and in particular to clustering and image processing. In this paper, we state a general version of the equivalence of the Wasserstein barycenter problem to the n-coupling problem. As a consequence, the coupling to the sum principle (characterizing solutions to the n-coupling problem) provides a novel criterion for the explicit characterization of barycenters. Based on this criterion, we provide as a main contribution the simple to implement iterative swapping algorithm (ISA) for computing barycenters. The ISA is a completely non-parametric algorithm which provides a sharp image of the support of the barycenter and has a quadratic time complexity which is comparable to other well established algorithms designed to compute barycenters. The algorithm can also be applied to more complex optimization problems like the k-barycenter problem. (C) 2019 Elsevier Inc. All rights reserved.
We introduce a new algorithm, called the swapping algorithm, to approximate numerically the minimal and maximal expected inner product of two random vectors with given marginal distributions. As a direct application, ...
详细信息
We introduce a new algorithm, called the swapping algorithm, to approximate numerically the minimal and maximal expected inner product of two random vectors with given marginal distributions. As a direct application, the algorithm computes an approximation of the L2-Wasserstein distance between two multivariate measures. The algorithm is simple to implement, accurate and less computationally expensive than the algorithms generally used in the literature for this problem. The algorithm also provides a discretized image of optimal measures and can be extended to more general cost functionals. (C) 2017 Elsevier Inc. All rights reserved.
This paper presents swapping of single-phase Cascaded Multilevel Inverter that uses four cascaded H-bridge power cells to optimize the usage of batteries or solar cells. swapping of H-bridge inverters involves phase s...
详细信息
ISBN:
(纸本)9781479964802
This paper presents swapping of single-phase Cascaded Multilevel Inverter that uses four cascaded H-bridge power cells to optimize the usage of batteries or solar cells. swapping of H-bridge inverters involves phase switching between the H-bridges. This method balances the battery utilization time in each cell which has been developed and simulated. The analysis of the total run-time of the batteries and battery discharge are worked out and the results are compared with conventional Cascaded H-bridge (CHB) inverters. The harmonics due to switching devices is reduced by using selective harmonic elimination method (SHE). Simulation results prove that the battery consumption level is less and it is about 60% efficient. The proposed inverter configuration will provide comparatively low power loss while comparing with other conventional inverters with the same output quality.
The so-called swapping algorithm was designed to simulate from spin glass distributions, among others. In this note we show that it mixes rapidly, in a very simple disordered system, the Hopfield model with two patter...
详细信息
The so-called swapping algorithm was designed to simulate from spin glass distributions, among others. In this note we show that it mixes rapidly, in a very simple disordered system, the Hopfield model with two patterns. (C) 2009 Elsevier B.V. All rights reserved.
Bit-reversal routine is considered as an essential part in Fast Fourier transforms (FFT) and Fast Hartley Transform (FHT). Image transposition and generalized sorting of multidimensional arrays are other interesting a...
详细信息
ISBN:
(纸本)9781479912063
Bit-reversal routine is considered as an essential part in Fast Fourier transforms (FFT) and Fast Hartley Transform (FHT). Image transposition and generalized sorting of multidimensional arrays are other interesting applications of bit-reversal algorithms. In this paper, we propose an efficient bit-reversal permutation algorithm, namely the swapping algorithm, that has a time complexity of O(root n). Moreover, it performs n-n(3/4) swaps (or exchanges) which are lower than the well-known transpose algorithm that performs 2n-n(3/4) exchanges. We use a look-up table of size root n to perform the bit-reversal experimentally. The results show that our proposed algorithm outperforms the transpose algorithm. Furthermore, our proposed algorithm can be used efficiently in parallel systems since it consists of parallelizable steps.
The use of random, or null, models to determine whether Species co-occurrences differ from chance expectations is an established technique in community ecology. Several methods have been used to draw conclusions regar...
详细信息
The use of random, or null, models to determine whether Species co-occurrences differ from chance expectations is an established technique in community ecology. Several methods have been used to draw conclusions regarding species co-occurrence patterns. We compared a sequential method derived previously with a recently proposed now method. Despite similarities in the methods, significant mathematical differences exist. The two methods produce significantly different results on a randomly generated example. While one method was supported by mathematical theory, the proposed new method cannot be justified mathematically because the statistical test was based on sequential steps that were not independent.
暂无评论