Honey bee based trust management system for cloud computing

Cloud computing has been considered as the new computing paradigm that would offer computer resources over the Internet as service.With the widespread use of cloud, computing would become another utility similar to electricity, water, gas and telephony where the customer would be paying only for the services consumed contrary to the current practice of paying a monthly or annual fixed charge irrespective of use.For cloud computing to become accepted by everybody, several issues need to be resolved.One of the most important issues to be addressed is cloud security.Trust management is one of the important components of cloud security that requires special attention. In this paper, the authors propose the concept that honey bee algorithm which has been developed to solve complex optimization problems can be successfully used to address this issue.The authors have taken a closer look at the optimization problems that had been solved using the honey bee algorithm and the similarity between these problems and the cloud computing environment.Thus concluding that the honey bee algorithm could be successfully used to solve the trust management issue in cloud computing

Shared Crossover Method for Solving Traveling Salesman Problem

Abstract. Genetic algorithms (GA) are evolutionary techniques that used crossover and mutation operators to solve optimization problems using a survival of the fittest idea. They have been used successfully in a variety of different problems, including the traveling salesman problem. The main idea of Traveling Salesman Problem (TSP) is to find the minimum traveling cost for visiting cities; the salesman must visit each city exactly once and return to the starting point of origin. Genetic algorithms are search methods that employ processes found in natural biological evolution. These algorithms search on a given population of potential solutions to find those that pass some specifications or criteria. In this paper, we apply modified genetic algorithm methodology for finding near-optimal solutions for TSP problem using shared neighbours to insure that the closest cities to have the highest priorities to be carried out to the next generation

Transducers based on networks of evolutionary processors LOS FINANCIADORES NO ESTÁN BIEN

We consider a new type of transducer that does not scan sequentially the input word. Instead, it consists of a directed graph whose nodes are processors which work in parallel and are specialized in just one type of a very simple evolutionary operation: inserting, deleting or substituting a symbol by another one. The computation on an input word starts with this word placed in a designated node, the input node, of the network an alternates evolutionary and communication steps. The computation halts as soon as another designated node, the output node, is nonempty. The translation of the input word is the set of words existing in the output node when the computation halts. We prove that these transducers can simulate the work of generalized sequential machines on every input. Furthermore, all words obtained by a given generalized sequential machine by the shortest computations on a given word can also be computed by the new transducers. Unlike the case of generalized sequential machines, every recursively enumerable language can be the transduction de?ned by the new transducer of a very simple regular language. The same idea may be used for proving that these transducers can simulate the shortest computations of an arbitrary Turing machine, used as a transducer, on every input word. Finally, we consider a restricted variant of NEP transducer, namely pure NEP transducers and prove that there are still regular languages whose pure NEP transductions are not semilinear