Efeitos de campos aleatórios e de anisotropias em vidros de spins

Ising and m-vector spin-glass models are studied, in the limit of infinite-range in-teractions, through the replica method. First, the m-vector spin glass, in the presence of an external uniform magnetic field, as well as of uniaxial anisotropy fields, is consi-dered. The effects of the anisotropics on the phase diagrams, and in particular, on the Gabay-Toulouse line, which signals the transverse spin-glass ordering, are investigated. The changes in the Gabay-Toulouse line, due to the presence of anisotropy fields which favor spin orientations along the Cartesian axes (m = 2: planar anisotropy; m = 3: cubic anisotropy), are also studied. The antiferromagnetic Ising spin glass, in the presence of uniform and Gaussian random magnetic fields, is investigated through a two-sublattice generalization of the Sherrington-Kirpaktrick model. The effects of the magnetic-field randomness on the phase diagrams of the model are analysed. Some confrontations of the present results with experimental observations available in the literature are discussed

A influência da recompensa e da experiência na discriminação visual simultânea em sagüi comum (Callithrix jacchus)

The discrimination learning is assessed through instrumental tasks in which the individual is rewarded for choosing one item over another. Thus, in concurrent visual discrimination of objects the animal must learn that only one of the objects will be rewarded. The concurrent visual discrimination is relatively simple, and already been observed Callithrix jacchus is able to accomplish this task. As yet wasn't seen the influence of the qualitative aspects of the rewards, in the performance of concurrent visual discrimination of objects in nonhuman primates, and as in most tests are used isolated animals, the present study had two stages: at first we had as objective to analyze the influence of the caloric value of the reward on the performance in concurrent visual discrimination of objects in isolated animals; in the second, we had the intention analyze performance of C. jacchus in realization of discrimination task in different social contexts, as well as, analyze the influence of previous experience in task performance. In the first stage (Study 1), the animals were not able to discriminate foods that presented small caloric differences . This incapacity in discriminates the rewards was responsible by generating randomness in task of concurrent visual discrimination of objects. In the second stage (Study 2), observed that, independent of social context in which the task was presented, the performance both of the experienced animals as the inexperienced animals tended to randomness. In the first case, is likely that the pattern of responses of the experienced animals is a reflection of their own performance when they were observed in isolation. In the second case, in turn, the randomness was probably due to the small number of sessions. Although present a pattern of performance similar to inexperienced individuals, we verify that the experienced animals monopolize the food consumption when they were in the presence of inexperienced individuals. This was a consequence of the experienced animals have presented lower latency the approximation of apparatus and, consequently, obtain more food. In turn, the inexperienced animals, when were in the presence of experienced, had to adopt alternative strategies to obtain food. Thus, C. jacchus is able to use the previous information he had about the task of solving their own benefit.

Uma investigação de algoritmos exatos e metaheurísticos aplicados ao nonograma

Nonogram is a logical puzzle whose associated decision problem is NP-complete. It has applications in pattern recognition problems and data compression, among others. The puzzle consists in determining an assignment of colors to pixels distributed in a N  M matrix that satisfies line and column constraints. A Nonogram is encoded by a vector whose elements specify the number of pixels in each row and column of a figure without specifying their coordinates. This work presents exact and heuristic approaches to solve Nonograms. The depth first search was one of the chosen exact approaches because it is a typical example of brute search algorithm that is easy to implement. Another implemented exact approach was based on the Las Vegas algorithm, so that we intend to investigate whether the randomness introduce by the Las Vegas-based algorithm would be an advantage over the depth first search. The Nonogram is also transformed into a Constraint Satisfaction Problem. Three heuristics approaches are proposed: a Tabu Search and two memetic algorithms. A new function to calculate the objective function is proposed. The approaches are applied on 234 instances, the size of the instances ranging from 5 x 5 to 100 x 100 size, and including logical and random Nonograms