Algoritmos genéticos: uso de lógica nebulosa e análise de convergência por cadeia de Markov

In this work, the Markov chain will be the tool used in the modeling and analysis of convergence of the genetic algorithm, both the standard version as for the other versions that allows the genetic algorithm. In addition, we intend to compare the performance of the standard version with the fuzzy version, believing that this version gives the genetic algorithm a great ability to find a global optimum, own the global optimization algorithms. The choice of this algorithm is due to the fact that it has become, over the past thirty yares, one of the more importan tool used to find a solution of de optimization problem. This choice is due to its effectiveness in finding a good quality solution to the problem, considering that the knowledge of a good quality solution becomes acceptable given that there may not be another algorithm able to get the optimal solution for many of these problems. However, this algorithm can be set, taking into account, that it is not only dependent on how the problem is represented as but also some of the operators are defined, to the standard version of this, when the parameters are kept fixed, to their versions with variables parameters. Therefore to achieve good performance with the aforementioned algorithm is necessary that it has an adequate criterion in the choice of its parameters, especially the rate of mutation and crossover rate or even the size of the population. It is important to remember that those implementations in which parameters are kept fixed throughout the execution, the modeling algorithm by Markov chain results in a homogeneous chain and when it allows the variation of parameters during the execution, the Markov chain that models becomes be non - homogeneous. Therefore, in an attempt to improve the algorithm performance, few studies have tried to make the setting of the parameters through strategies that capture the intrinsic characteristics of the problem. These characteristics are extracted from the present state of execution, in order to identify and preserve a pattern related to a solution of good quality and at the same time that standard discarding of low quality. Strategies for feature extraction can either use precise techniques as fuzzy techniques, in the latter case being made through a fuzzy controller. A Markov chain is used for modeling and convergence analysis of the algorithm, both in its standard version as for the other. In order to evaluate the performance of a non-homogeneous algorithm tests will be applied to compare the standard fuzzy algorithm with the genetic algorithm, and the rate of change adjusted by a fuzzy controller. To do so, pick up optimization problems whose number of solutions varies exponentially with the number of variables

Estimadores do tipo núcleo para a densidade de transição de uma cadeia de markov com espaço de estados geral

In this work, we studied the strong consistency for a class of estimates for a transition density of a Markov chain with general state space E ⊂ Rd. The strong ergodicity of the estimates for the density transition is obtained from the strong consistency of the kernel estimates for both the marginal density p(:) of the chain and the joint density q(., .). In this work the Markov chain is supposed to be homogeneous, uniformly ergodic and possessing a stationary density p(.,.)

Métodos estatisticos em cadeias de Markov

Este trabalho tem como objetivo o estudo do comportamento assintótico da estatística de Pearson (1900), que é o aparato teórico do conhecido teste qui-quadrado ou teste x2 como também é usualmente denotado. Inicialmente estudamos o comportamento da distribuição da estatística qui-quadrado de Pearson (1900) numa amostra {X1, X2,...,Xn} quando n → ∞ e pi = pi0 , 8n. Em seguida detalhamos os argumentos usados em Billingley (1960), os quais demonstram a convergência em distribuição de uma estatística, semelhante a de Pearson, baseada em uma amostra de uma cadeia de Markov, estacionária, ergódica e com espaço de estados finitos S

Estimação paramétrica e não-paramétrica em modelos de markov ocultos

In this work we study the Hidden Markov Models with finite as well as general state space. In the finite case, the forward and backward algorithms are considered and the probability of a given observed sequence is computed. Next, we use the EM algorithm to estimate the model parameters. In the general case, the kernel estimators are used and to built a sequence of estimators that converge in L1-norm to the density function of the observable process

Modelagem dos algorítmos simples e Simulated Annealing por cadeias de Markov

Os Algoritmos Genético (AG) e o Simulated Annealing (SA) são algoritmos construídos para encontrar máximo ou mínimo de uma função que representa alguma característica do processo que está sendo modelado. Esses algoritmos possuem mecanismos que os fazem escapar de ótimos locais, entretanto, a evolução desses algoritmos no tempo se dá de forma completamente diferente. O SA no seu processo de busca trabalha com apenas um ponto, gerando a partir deste sempre um nova solução que é testada e que pode ser aceita ou não, já o AG trabalha com um conjunto de pontos, chamado população, da qual gera outra população que sempre é aceita. Em comum com esses dois algoritmos temos que a forma como o próximo ponto ou a próxima população é gerada obedece propriedades estocásticas. Nesse trabalho mostramos que a teoria matemática que descreve a evolução destes algoritmos é a teoria das cadeias de Markov. O AG é descrito por uma cadeia de Markov homogênea enquanto que o SA é descrito por uma cadeia de Markov não-homogênea, por fim serão feitos alguns exemplos computacionais comparando o desempenho desses dois algoritmos

Teoria da Ruína em um Modelo de Markov com dois Estados

In this work, we present a risk theory application in the following scenario: In each period of time we have a change in the capital of the ensurance company and the outcome of a two-state Markov chain stabilishs if the company pays a benece it heat to one of its policyholders or it receives a Hightimes c > 0 paid by someone buying a new policy. At the end we will determine once again by the recursive equation for expectation the time ruin for this company

Controle on-line do número de não-conformidades por itens em uma produção finita

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior

Controle on-line por atributos para o número de não-conformidades no item inspecionado com base em uma sequência de inspeção

This paper proposes a procedure to control on-line processes for attributes, using an Shewhart control chart with two control limits (warning limit and control limit) and will be based on a sequence of inspection (h). The inspection procedure is based on Taguchi et al. (1989), in which to inspect the item, if the number of non-conformities is higher than an upper control limit, the process needs to be stopped and some adjustment is required; and, if the last inspection h, from all items inspected present a number of non-conformities between the control limit and warning limit. The items inspected will suffer destructive inspection, being discarded after inspection. Properties of an ergodic Markov chain are used to get the expression of average cost per item and the aim was the determination of four optimized parameters: the sampling interval of the inspections (m); the constant W to draw the warning limit (W); the constant C to draw the control limit (C), where W £ C, and the length of sequence of inspections (h). Numerical examples illustrate the proposed procedure

Comportamento social de botos-cinza, sotalia guianensis, na praia de Pipa, RN, Brasil: dinâmica, sequência, sincronia e respostas ao turismo de observação

Social behavior of Guiana dolphins, Sotalia guianensis, at Pipa Beach, RN, Brazil: dynamics, sequence, breathing synchrony, and responses to dolphin watching. Social animals form groups that can range from temporary to permanent. Depending on the nature of the social relationships developed between individuals, groups present a particular social organization and the effect of these interactions shapes the activity patterns of these animals. This study investigates: (i) fission-fusion dynamics of Guiana dolphins, through the analysis of three dimensions of the social system (variation in spatial cohesion, variation in size and composition of groups), (ii) sequence, routine and behavioral stability, (iii) breathing intervals in synchronized groups and (iv) behavioral responses of the animals to dolphin watching. Systematic observations of Guiana dolphins were made from a platform located in cliffs about 25 m above sea level that surround Madeiro Bay, Pipa Beach. Sampling occurred from December 2007 to February 2009 between 0600 h and 1600 h, and the groups of Guiana dolphins were investigated according to their size (alone and group) and composition (adults, adults and juveniles, and adults and calves). According to the analysis of fission-fusion dynamics, Guiana dolphin groups frequently changed their composition, modifying their patterns of spatial grouping and cohesion every 20 minutes on average. More than 50% of the individuals maintained a distance of up to 2 m from other group members and new individuals were attracted to the group, especially during feeding, leaving it for foraging. Large groups were more unstable than small, while groups containing only adults were more stable than groups of adults and juveniles. According to the Z-score analysis to investigate the sequence and behavioral routine, lone individuals were more ! .7! ! involved in foraging and feeding, while resting was more common in groups. Foraging and feeding were more common in homogeneous groups (individuals of the same age class), while heterogeneous groups (different age classes) were often involved in socialization, displaying a broader behavioral repertoire. Foraging and resting behavior presented higher stability (continuous duration in minutes) than the other behaviors. The analysis of breathing intervals in synchronized groups showed significant differences depending on type of behavior, composition and area preference. During resting, breathing intervals were of longer duration, and groups with calves showed shorter breathing intervals than groups without calves. Lone individuals also preferred areas called corral , often used for the entrapment of fishes. The Markov chain analysis revealed behavioral changes in the presence of boats, according to the type of group composition. Groups composed of adults presented decreased resting and increased in traveling during the presence of boats. Groups of adults and juveniles showed a massive reduction of socialization, while the behavior transition probability traveling-traveling was higher in groups of adults and calves. In the presence of the boats, stability of resting was reduced by one third of its original duration and traveling more than doubled. The behavioral patterns analyzed are discussed in light of socio-ecological models concerning costs and benefits of proximity between individuals and behavioral optimization. Furthermore, significant changes in behavioral patterns indicate that Guiana dolphins, at Pipa Beach, have suffered the effects of tourism as a result of violation of rules of conduct established for the study area

A teoria da ruína aplicada em um modelo de empresa financeira com risco de crédito

In this work we study a new risk model for a firm which is sensitive to its credit quality, proposed by Yang(2003): Are obtained recursive equations for finite time ruin probability and distribution of ruin time and Volterra type integral equation systems for ultimate ruin probability, severity of ruin and distribution of surplus before and after ruin

Controle on-line para o número de não-conformidades em um ítem inspecionado

The on-line processes control for attributes consists of inspecting a single item at every m produced ones. If the examined item is conforming, the production continues; otherwise, the process stops for adjustment. However, in many practical situations, the interest consist of monitoring the number of non-conformities among the examined items. In this case, if the number of non-conformities is higher than an upper control limit, the process needs to be stopped and some adjustment is required. The contribution of this paper is to propose a control system for the number of nonconforming of the inspected item. Employing properties of an ergodic Markov chain, an expression for the expected cost per item of the control system was obtained and it will be minimized by two parameters: the sampling interval and the upper limit control of the non-conformities of the examined item. Numerical examples illustrate the proposed procedure

Ajuste preventivo versus ajuste corretivo no controle on-line de processo do número de não-conformidades num item inspecionado

In production lines, the entire process is bound to unexpected happenings which may cost losing the production quality. Thus, it means losses to the manufacturer. Identify such causes and remove them is the task of the processing management. The on-line control system consists of periodic inspection of every month produced item. Once any of those items is quali ed as not t, it is admitted that a change in the fraction of the items occurred, and then the process is stopped for adjustments. This work is an extension of Quinino & Ho (2010) and has as objective main to make the monitoramento in a process through the control on-line of quality for the number of non-conformities about the inspected item. The strategy of decision to verify if the process is under control, is directly associated to the limits of the graphic control of non-conformities of the process. A policy of preventive adjustments is incorporated in order to enlarge the conforming fraction of the process. With the help of the R software, a sensibility analysis of the proposed model is done showing in which situations it is most interesting to execute the preventive adjustment

Behavioural profiles of captive capuchin monkeys (Sapajus spp.): analyses at group and individual levels

The use of behavioural indicators of suffering and welfare in captive animals has produced ambiguous results. In comparisons between groups, those in worse condition tend to exhibit increased overall rate of Behaviours Potentially Indicative of Stress (BPIS), but when comparing within groups, individuals differ in their stress coping strategies. This dissertation presents analyses to unravel the Behavioural Profile of a sample of 26 captive capuchin monkeys, of three different species (Sapajus libidinosus, S. flavius and S. xanthosternos), kept in different enclosure types. In total, 147,17 hours of data were collected. We explored four type of analysis: Activity Budgets, Diversity indexes, Markov chains and Sequence analyses, and Social Network Analyses, resulting in nine indexes of behavioural occurrence and organization. In chapter One we explore group differences. Results support predictions of minor sex and species differences and major differences in behavioural profile due to enclosure type: i. individuals in less enriched enclosures exhibited a more diverse BPIS repertoire and a decreased probability of a sequence with six Genus Normative Behaviour; ii. number of most probable behavioural transitions including at least one BPIS was higher in less enriched enclosures; iii. proeminence indexes indicate that BPIS function as dead ends of behavioural sequences, and proeminence of three BPIS (pacing, self-direct, active I) were higher in less enriched enclosures. Overall, these data are not supportive of BPIS as a repetitive pattern, with a mantra-like calming effect. Rather, the picture that emerges is more supportive of BPIS as activities that disrupt organization of behaviours, introducing “noise” that compromises optimal activity budget. In chapter Two we explored individual differences in stress coping strategies. We classified individuals along six axes of exploratory behaviour. These were only weakly correlated indicating low correlation among behavioural indicators of syndromes. Nevertheless, the results are suggestive of two broad stress coping strategies, similar to the bold/proactive and shy/reactive pattern: more exploratory capuchin monkeys exhibited increased values of proeminence in Pacing, aberrant sexual display and Active 1 BPIS, while less active animals exhibited increased probability in significant sequences involving at least one BPIS, and increased prominence in own stereotypy. Capuchin monkeys are known for their cognitive capacities and behavioural flexibility, therefore, the search for a consistent set of behavioural indictors of welfare and individual differences requires further studies and larger data sets. With this work we aim contributing to design scientifically grounded and statistically correct protocols for collection of behavioural data that permits comparability of results and meta-analyses, from whatever theoretical perspective interpretation it may receive.

Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral

In this work we studied the consistency for a class of kernel estimates of f f (.) in the Markov chains with general state space E C Rd case. This study is divided into two parts: In the first one f (.) is a stationary density of the chain, and in the second one f (x) v (dx) is the limit distribution of a geometrically ergodic chain

Ergodicidade em cadeias de Markov não-homogêneas e cadeias de Markov com transições raras

The central objective of a study Non-Homogeneous Markov Chains is the concept of weak and strong ergodicity. A chain is weak ergodic if the dependence on the initial distribution vanishes with time, and it is strong ergodic if it is weak ergodic and converges in distribution. Most theoretical results on strong ergodicity assume some knowledge of the limit behavior of the stationary distributions. In this work, we collect some general results on weak and strong ergodicity for chains with space enumerable states, and also study the asymptotic behavior of the stationary distributions of a particular type of Markov Chains with finite state space, called Markov Chains with Rare Transitions