In [?] Lin, Wang and Zhou propose the iterative Toeplitz filters algorithm as an alternative iterative algorithm for EMD. In this alternative algorithm, the average of the upper and lower envelopes is replaced by certain “moving average” obtained through a low-pass filter. Performing the tradition sifting algorithm with such moving averages is equivlalent to iterating certain convolution filter...

Given an n-dimensional random variable X with a joint density fX(x1, · · · , xn), the density of Y = h(X) is computed as a surface integral of fX in two cases: (a) h linear, and (b) h sum of squares. The integrals use the volume of the Jacobian matrix in a change-of-variables formula. Lin. Algeb. and Appl. 321(2001), 9–25

Abstract. We use the Local Optima Network model to study the structure of symmetric TSP fitness landscapes. The ‘big-valley’ hypothesis holds that for TSP and other combinatorial problems, local optima are not randomly distributed, instead they tend to be clustered around the global optimum. However, a recent study has observed that, for solutions close in evaluation to the global optimum, this...

The most common starting point for investors when buying a stock is to look at the trend of price changes. In recent years, different models have been used to predict stock prices by researchers, and since artificial intelligence techniques, including neural networks, genetic algorithms and fuzzy logic, have achieved successful re-sults in solving complex problems; in this regard, more exploita...

We propose a powerful Reinforced Hybrid Genetic Algorithm (RHGA) for the famous NP-hard Traveling Salesman Problem (TSP). RHGA combines reinforcement learning technique with well-known Edge Assembly Crossover genetic algorithm (EAX-GA) and Lin-Kernighan-Helsgaun (LKH) local search heuristic. With help of proposed hybrid mechanism, evolution EAX-GA LKH can boost each other's performance. And bas...

We formalize a combinatorial principle, called the 3XOR principle, due to Feige, Kim and Ofek [14], as a family of unsatisfiable propositional formulas for which refutations of small size in any propositional proof system that possesses the feasible interpolation property imply an efficient deterministic refutation algorithm for random 3SAT with n variables and Ω(n) clauses. Such small size ref...