Este trabalho é em parte baseado no livro The Stability and Control of Discrete Processes de Joseph P. LaSalle. Nós estudamos equações como x(n+1) = T(x(n)), onde T : \' R POT. m\' \' SETA\' \'R POT. m\' é uma aplicação contínua, com o sistema dinâmico associado \'PI\' (n,x) := \' T POT. n\' (x). Nós fornecemos condições suficientes para a estabilidade de equilíbrios usando o método direto de Liapunov. Também consideramos sistemas discretos da forma x(n+1)=T(n, x(n),\'lâmbda\' ) dependendo de uma parâmetro \' lâmbda\' e apresentamos resultados obtendo estimativas de atratores. Finalmente, nós apresentamos algumas simulações de sistemas acoplados como uma aplicação em sistemas de comunicação / This work is in part based on the book The Stability and Control of Discrete Processes of Joseph P. LaSalle. We studing equations as x(n+1) = T(x(n)), where T : \' R POT.m\' \' ARROW\' \' \' R POT.m\' is continuous transformation, with the associated dynamic system \'PI\' (n,x) := \' T POT.n\' (x). We provide suddicient conditions for stability of equilibria, using Liapunov direct method. We also consider nonautonomous discrete systems of the form x(n + 1) = T(n, x(n), \' lâmbda\') depending on the parameter \'lâmbda\' and present results obtaining uniform estimatives of attractors. We finally we present some simulations on synchronization of coupled systems as an application on communication systems

No description available.

Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-08-13T14:00:11Z No. of bitstreams: 1 BRUNA EMANUELLY PEREIRA LUCENA - DISSERTAÇÃO PPGMAT 2017..pdf: 863254 bytes, checksum: 3efc054cddb6d37b4195e53987dc8906 (MD5) / Made available in DSpace on 2018-08-13T14:00:11Z (GMT). No. of bitstreams: 1 BRUNA EMANUELLY PEREIRA LUCENA - DISSERTAÇÃO PPGMAT 2017..pdf: 863254 bytes, checksum: 3efc054cddb6d37b4195e53987dc8906 (MD5) Previous issue date: 2017-03 / Capes / Para ler o resumo deste trabalho recomendamos o download do arquivo, uma vez que o mesmo possui fórmulas e caracteres matemáticos que não foram possíveis trascreve-los aqui. / To read the summary of this work we recommend downloading the file, since it has formulas and mathematical characters that were not possible to transcribe them here.

Cette thèse s'intéresse aux évènements et aux ordonnancements d'évènements se produisant au sein de réseaux d'éléments conceptuels prédéterminés. Dans ces réseaux, les éléments, appelés plutôt "automates", s'incitent les uns les autres à changer d'état en accord avec des règles prédéfinies qui, précisément, définissent le (fonctionnement du) réseau. Lorsqu'un automate se conforme effectivement aux influences qu'il reçoit de la part des autres, on dit que son état est mis à jour. Les évènements élémentaires considérés sont les changements d'états des automates. Définir un mode de mise à jour pour l'ensemble des automates d'un réseau permet de sélectionner certains évènements parmi l'ensemble de ceux qui sont a priori possibles. Cela permet aussi d'organiser et d'ordonner les évènements les uns par rapport aux autres de façon, par exemple, à imposer que des évènements indépendants se produisent simultanément ou simplement, de manière assez rapprochée pour qu'aucun autre événement ne puisse se produire pendant leur occurrence. Informellement, les modes de mise à jour peuvent donc être interprétés comme l'expression d'influences extérieures au réseau interdisant certains changements, ou alors comme la formalisation d'une version relâchée et relative de l'écoulement de temps. Cette thèse propose d'étudier leur influence sur le comportement des réseaux. Et afin de distinguer cette influence de celle de la structure des réseaux, elle commence par mettre en évidence le rôle de certains motifs structurels. Après ça, elle s'intéresse en particulier à l'information "encodée" dans une séquence de mises à jour et à l'impact du synchronisme dans celles-ci. / This thesis is concerned with the events and the organisation of events that take place within networks of abstract predetermined elements called "automata". In these networks, automata incite one another to switch states in agreement with predefined rules which, precisely, define the net-work. When an automaton effectively conforms to the influences it receives from others, its state is said to be updated. The elementary events that are considered here are thus automata state changes. To define an update mode for all the automata of a network allows to select some events among all those that are a priori possible. It also allows to organise and order the events relatively so as to impose, for example, that independent events occur simultaneously or so that simply, they happen close enough to disallow the occurrence of any other events in between. Informally, update modes can be interpreted as the expressions of influences incoming from outside the network, forbidding certain changes, or else, as the formalisation of a relaxed and relative version of time flow. This thesis proposes to study their influences on network behaviours. And to distinguish their influences from that of network structures, it starts by highlighting the role of certain structural motives. After that, it explores in particular the information that is "encoded" in a sequence of updates as well as the general impact of synchronism in updates.

No description available.

Considere um meio caracterizado por $N$ pontos cujas coordenadas são geradas aleatoriamente de maneira uniforme nas arestas unitárias de um hipercubo $d$-dimensional. Um caminhante parte de cada ponto deste meio desordenado e se movimenta obedecendo à regra determinista de ir para o ponto mais próximo que não tenha sido visitado nos últimos $mu$ passos. Este processo foi denominado de caminhada determinista do turista. Cada trajetória gerada por esta dinâmica possui uma parte inicial não-periódica de $t$ passos (transiente) e uma parte final periódica de $p$ passos (atrator). As probabilidades de vizinhança são expressas através da fórmula de Cox, que é parametrizada pela função beta incompleta normalizada $I_d = I_{1/4}[1/2,(d+1)/2]$. Enfati-zamos aqui que a distribuição relevante é $S_{mu,d}^{(N)}(t,p)$, a distribuição conjunta de $t$ e $p$, que tem como casos particulares as distribuições marginais, previamente estudadas. O objetivo deste estudo é obter analiticamente estas distribuições para a caminhada determinista do turista sem memória no espaço euclideano, no modelo de distâncias aleatórias (que corresponde ao limite $d ightarrow infty$) e no modelo de mapeamento aleatório (que é um caso limite das redes de Kauffman). As distribuições analíticas obtidas foram validadas através de experimentos numéricos. A distribuição conjunta de tempos de transiente e período de atratores, no limite termodinâmico para uma dimensionalidade arbitrária vale: $S_{1,d}^{(infty)}(t,p) = [Gamma(1+I_d^{-1}) cdot (t+I_d^{-1})/Gamma(t+p+I_d^{-1})] cdot delta_{p,2}$, onde $t=0,1,2,ldots,infty$; $Gamma(z)$ é a função gama e $delta_{i,j}$ é o delta de Kronecker. A caminhada determinista do turista sem memória no modelo de mapeamento aleatório produz uma distribuição de períodos não-trivial ($S_{0,rm}^{(N)}(p) propto p^{-1}$), que é obtida de $S_{0,rm}^{(N)}(t,p) = Gamma(N)/{Gamma[N+1-(t+p)]N^{t+p}}$, onde enfatizamos que o número de pontos explorados $n_e=t+p$ é a grandeza fundamental nos problemas considerados. / Consider a medium characterized by $N$ points whose coordinates are randomly generated by a uniform distribution along the unitary edges of a $d$-dimensional hypercube. A walker leaves from each point of this disordered medium and moves according to the deterministic rule to go the nearest point which has not been visited in the preceding $mu$ steps. This process has been called the deterministic tourist walk. Each trajectory generated by this dynamics has an initial non-periodic part of $t$ steps (transient) and a final periodic part of $p$ steps (attractor). The neighborhood probabilities are given by the Cox formula, which is parameterized by the normalized incomplete beta function $I_d = I_{1/4}[1/2,(d+1)/2]$. Here we stress that the relevant distribution is the joint $t$ and $p$ distribution $S_{mu,d}^{(N)}(t,p)$, which has as particular cases, the marginal distributions previously studied. The objective of this study is to obtain analytically these distributions for the memoryless deterministic tourist walk in the euclidean space, random link model (which corresponds to $d ightarrow infty$ limit) and random map model (which is a limiting case of the Kauffman model). The obtained distributions have been validated by numerical experiments. The joint transient time and attractor period distribution in the thermodynamic limit for an arbitrary dimensionality is: $S_{1,d}^{(infty)}(t,p) = [Gamma(1+I_d^{-1}) cdot (t+I_d^{-1})/Gamma(t+p+I_d^{-1})] cdot delta_{p,2}$, where $t=0,1,2,ldots,infty$; $Gamma(z)$ is the gamma function and $delta_{i,j}$ is the Kronecker's delta. The memoryless deterministic tourist walk in the random map leads to a non-trivial cycle distribution ($S_{0,rm}^{(N)}(p) propto p^{-1}$), which is obtained from $S_{0,rm}^{(N)}(t,p) = Gamma(N)/{Gamma[N+1-(t+p)]N^{t+p}}$, where we stress that the number of explored points $n_e=t+p$ is the fundamental quantity in the considered problems.

Considere um meio desordenado constituído por $N$ pontos cujas coordenadas são geradas aleatoriamente de maneira uniforme e independente nas arestas unitárias de um hipercubo $d$-dimensional. As probabilidades de vizinhança entre os pares de pontos deste meio são expressas através da fórmula de Cox. Um caminhante parte de um dado ponto deste meio desordenado e se movimenta obedecendo à regra determinista de ir para o ponto mais próximo que não tenha sido visitado nos últimos $\\mu$ passos. Este processo foi denominado de caminhada determinista do turista. Cada trajetória gerada por esta dinâmica possui uma parte inicial não-periódica de $t$ passos (transiente) e uma parte final periódica de $p$ passos (atrator). Neste trabalho, obtemos analiticamente algumas distribuições estatísticas para a caminhada determinista do turista com memória $\\mu$ arbitrária em sistemas unidimensionais e com memória $\\mu=2$ no modelo Random Link (que corresponde ao limite $d ightarrow 1$). Estes resultados nos permitiram compreender o papel da memória no comportamento exploratório do turista e explicar a equivalência não-trivial entre o modelo Random Link e o modelo Random Map (que é um caso limite das redes de Kauffman). Enfatizamos que o número de pontos explorados pelo turista é a grandeza fundamental nos problemas considerados. As distribuições analíticas obtidas foram validadas através de experimentos numéricos. Também obtivemos uma dedução alternativa para a fórmula de Cox, apresentando os resultados finais em termos de distribuições estatísticas elementares. / Consider a medium characterized by $N$ points whose coordinates are randomly and independently generated by a uniform distribution along the unitary edges of a $d$-dimensional hypercube. The neighborhood probabilities between any pair of points in this medium are given by the Cox formula. A walker leaves from each point of this disordered medium and moves according to the deterministic rule to go the nearest point which has not been visited in the preceding $\\mu$ steps. This process has been called the deterministic tourist walk. Each trajectory generated by this dynamics has an initial non-periodic part of $t$ steps (transient) and a final periodic part of $p$ steps (attractor). In this work, we obtain analytically some statistical distributions for the deterministic tourist walk with arbitrary memory $\\mu$ in one-dimensional systems and with memory $\\mu=2$ in the random link model (which corresponds to $d ightarrow 1$ limit). These results enable us to understand the main role played by the memory on the tourist\'s exploratory behavior and explain the non-trivial equivalence between the random link model and the random map model (which is a limiting case of the Kauffman model). We stress that the number of explored points is the fundamental quantity in the considered problems. The obtained distributions have been validated by numerical experiments. We also obtain an alternative derivation for the Cox formula, writing the final results in terms of known statistical distributions.

Este trabalho é em parte baseado no livro The Stability and Control of Discrete Processes de Joseph P. LaSalle. Nós estudamos equações como x(n+1) = T(x(n)), onde T : \' R POT. m\' \' SETA\' \'R POT. m\' é uma aplicação contínua, com o sistema dinâmico associado \'PI\' (n,x) := \' T POT. n\' (x). Nós fornecemos condições suficientes para a estabilidade de equilíbrios usando o método direto de Liapunov. Também consideramos sistemas discretos da forma x(n+1)=T(n, x(n),\'lâmbda\' ) dependendo de uma parâmetro \' lâmbda\' e apresentamos resultados obtendo estimativas de atratores. Finalmente, nós apresentamos algumas simulações de sistemas acoplados como uma aplicação em sistemas de comunicação / This work is in part based on the book The Stability and Control of Discrete Processes of Joseph P. LaSalle. We studing equations as x(n+1) = T(x(n)), where T : \' R POT.m\' \' ARROW\' \' \' R POT.m\' is continuous transformation, with the associated dynamic system \'PI\' (n,x) := \' T POT.n\' (x). We provide suddicient conditions for stability of equilibria, using Liapunov direct method. We also consider nonautonomous discrete systems of the form x(n + 1) = T(n, x(n), \' lâmbda\') depending on the parameter \'lâmbda\' and present results obtaining uniform estimatives of attractors. We finally we present some simulations on synchronization of coupled systems as an application on communication systems

Hippocampal place-cell sequences observed during awake immobility often represent previous experience, suggesting a role in memory processes. However, recent reports of goals being overrepresented in sequential activity suggest a role in short-term planning, although a detailed understanding of the origins of hippocampal sequential activity and of its functional role is still lacking. In particular, it is unknown which mechanism could support efficient planning by generating place-cell sequences biased toward known goal locations, in an adaptive and constructive fashion. To address these questions, we propose a model of spatial learning and sequence generation as interdependent processes, integrating cortical contextual coding, synaptic plasticity and neuromodulatory mechanisms into a map-based approach. Following goal learning, sequential activity emerges from continuous attractor network dynamics biased by goal memory inputs. We apply Bayesian decoding on the resulting spike trains, allowing a direct comparison with experimental data. Simulations show that this model (1) explains the generation of never-experienced sequence trajectories in familiar environments, without requiring virtual self-motion signals, (2) accounts for the bias in place-cell sequences toward goal locations, (3) highlights their utility in flexible route planning, and (4) provides specific testable predictions.

This Master's thesis deals with history of Fractal geometry and describes the fractal science development. In the begining there are essential Fractal science terms explained. Then description of fractal types and typical or most known examples of them are mentioned. Fractal knowledge application besides computer graphics area is discussed. Thesis informs about fractal geometry practical usage. Few present software packages or more programs which can be used for making fractal pictures are described in this work. Some of theirs capabilities are described. Thesis' practical part consists of slides, demonstrational program and poster. Electronical slides represents brief scheme usable for fractal geometry realm lectures. Program generates selected fractal types. Thesis results are projected on poster.