: This paper presents an algorithm for solving the multi-objective reactive power dispatch problem in a power system. Modal analysis of the system is used for static voltage stability assessment. Loss minimization and maximization of voltage stability margin are taken as the objectives. Generator terminal voltages, reactive power generation of the capacitor banks and tap changing transformer se...

Resource scheduling under the condition of cloud computing has always been the focus of current research. This paper analyzes the current situation of cloud computing and introduces shuffled frog leaping algorithm in resource allocation. Aiming at that shuffled frog algorithm is easy to fall into local optimum with fast convergence speed, artificial vector machine is introduced into the subgrou...

This paper introduces a Shuffled Frog-Leaping Algorithm based method for the optimization of machining parameters for milling operations. An objective function based on maximum profit in milling operation has been used. The algorithm is compared with others techniques and outperforms the results reached by standard shuffled frogleaping algorithm, differential evolution, particle swarm optimizat...

In this paper, we propose a high capacity data hiding method applying in binary images. Since image has only two colors, black or white, it is hard to hide imperceptible. The capacities and imperception are always trade-off problem. Before embedding shuffle the secret by pseudo-random number generator keep more secure. We divide host into several non-overlapping (2n+1) sub-blocks an M N as many...

In research on eye-movement control during reading, the importance of cognitive processes related to language comprehension relative to visuomotor aspects of saccade generation is the topic of an ongoing debate. Here we investigate various eye-movement measures during reading of randomly shuffled meaningless text as compared to normal meaningful text. To ensure processing of the material, reade...

The purpose of this paper is to study properties of mapped shuffled Fibonacci languages F(afi) and F^vy Let X — {a?6} be an alphabet and let X* be the free monoid generated by X. Let 1 be the empty word and let X+ — X* \ {1}. The length of a word u is denoted by lg(w). Every subset of X* is called a language. For two words u, v E X + ? we consider the following type of Fibonacci sequence of words: