Por favor, use este identificador para citar o enlazar este ítem:
|Título:||A computational intelligence optimization algorithm based on the behavior of the social-spider|
|Autor:||Klimov, Andrei B.|
De Guise, H.
|Fecha de publicación:||2005|
|Resumen:||We develop a comprehensive theory of phase for finite-dimensional quantum systems. The only physical requirement we impose is that phase is complementary to amplitude. To implement this complementarity we use the notion of mutually unbiased bases, which exist for dimensions that are powers of a prime. For a d-dimensional system (qudit) we explicitly construct d+1 classes of maximally commuting operators, each one consisting of d-1 operators. One of these classes consists of diagonal operators that represent amplitudes (or inversions). By finite Fourier transformation, it is mapped onto ladder operators that can be appropriately interpreted as phase variables. We discuss examples of qubits and qutrits, and show how these results generalize previous approaches. " 2005 IOP Publishing Ltd.",,,,,,"10.1088/1464-4266/7/9/008",,,"http://hdl.handle.net/20.500.12104/38948","http://www.scopus.com/inward/record.url?eid=2-s2.0-25144524029&partnerID=40&md5=bde88e1cc9332ada4d1ca976b4193451",,,,,,"9",,"Journal of Optics B: Quantum and Semiclassical Optics",,"283|
WOS",,,,,,"Complementarity; Finite Fourier transform; Finite quantum systems; Quantum phase/Optics; Physics",,,,,,"A complementarity-based approach to phase in finite-dimensional quantum systems",,"Article" "40732","123456789/35008",,"Cuevas, E., Departamento de Electrónica, CUCEI, Universidad de GuadalajaraGuadalajara, Mexico; Cienfuegos, M., Departamento de Electrónica, CUCEI, Universidad de GuadalajaraGuadalajara, Mexico; Rojas, R., Institut Fér Informatik, Freie Universityt BerlinBerlin, Germany; Padilla, A., Instituto Tecnológico de CelayaCelaya, Mexico",,"Cuevas, E.
Padilla, A.",,"2015",,"Classical optimization methods often face great difficulties while dealing with several engineering applications. Under such conditions, the use of computational intelligence approaches has been recently extended to address challenging real-world optimization problems. On the other hand, the interesting and exotic collective behavior of social insects have fascinated and attracted researchers for many years. The collaborative swarming behavior observed in these groups provides survival advantages, where insect aggregations of relatively simple and "unintelligent" individuals can accomplish very complex tasks using only limited local information and simple rules of behavior. Swarm intelligence, as a computational intelligence paradigm, models the collective behavior in swarms of insects or animals. Several algorithms arising from such models have been proposed to solve a wide range of complex optimization problems. In this chapter, a novel swarm algorithm called the Social Spider Optimization (SSO) is proposed for solving optimization tasks. The SSO algorithm is based on the simulation of cooperative behavior of social-spiders. In the proposed algorithm, individuals emulate a group of spiders which interact to each other based on the biological laws of the cooperative colony. The algorithm considers two different search agents (spiders): males and females. Depending on gender, each individual is conducted by a set of different evolutionary operators which mimic different cooperative behaviors that are typically found in the colony. In order to illustrate the proficiency and robustness of the proposed approach, it is compared to other well-known evolutionary methods. The comparison examines several standard benchmark functions that are commonly considered within the literature of evolutionary algorithms. The outcome shows a high performance of the proposed method for searching a global optimum with several benchmark functions. " 2015 Springer International Publishing Switzerland
|Aparece en las colecciones:||Producción científica UdeG|
Ficheros en este ítem:
No hay ficheros asociados a este ítem.
Los ítems de RIUdeG están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.