91 resultados para Non-Autonomous Dynamical Systems
Resumo:
It is very common in mathematics to construct surfaces by identifying the sides of a polygon together in pairs: For example, identifying opposite sides of a square yields a torus. In this article the construction is considered in the case where infinitely many pairs of segments around the boundary of the polygon are identified. The topological, metric, and complex structures of the resulting surfaces are discussed: In particular, a condition is given under which the surface has a global complex structure (i.e., is a Riemann surface). In this case, a modulus of continuity for a uniformizing map is given. The motivation for considering this construction comes from dynamical systems theory: If the modulus of continuity is uniform across a family of such constructions, each with an iteration defined on it, then it is possible to take limits in the family and hence to complete it. Such an application is briefly discussed.
Resumo:
We extend the renormalization operator introduced in [A. de Carvalho, M. Martens and M. Lyubich. Renormalization in the Henon family, I: universality but non-rigidity. J. Stat. Phys. 121(5/6) (2005), 611-669] from period-doubling Henon-like maps to Henon-like maps with arbitrary stationary combinatorics. We show that the renonnalization picture also holds in this case if the maps are taken to be strongly dissipative. We study infinitely renormalizable maps F and show that they have an invariant Cantor set O on which F acts like a p-adic adding machine for some p > 1. We then show, as for the period-doubling case in the work of de Carvalho, Martens and Lyubich [Renormalization in the Henon family, I: universality but non-rigidity. J. Stat. Phys. 121(5/6) (2005), 611-669], that the sequence of renormalizations has a universal form, but that the invariant Cantor set O is non-rigid. We also show that O cannot possess a continuous invariant line field.
Resumo:
Neste artigo tivemos a intenção de oferecer ao leitor o resumo de um dos aspectos mais importantes da análise estrutural que realizamos, durante décadas, do texto de Jean Piaget, sobretudo as estreitas relações entre a Biologia e a Lógica na construção e na explicação do conhecimento científico. Nesse sentido, procuramos demonstrar que, a partir dos conceitos de implicação significante e de imagem mental criados por Piaget, um novo campo de investigações se abre, a saber, aquele que denominamos como o dos sistemas de significação não lógica, campo de suma relevância e que vem preencher uma secular lacuna entre a razão e a emoção até hoje presente nas pesquisas sobre os fenômenos normais e patológicos do psiquismo.
Resumo:
We investigate synchronization in a Kuramoto-like model with nearest neighbor coupling. Upon analyzing the behavior of individual oscillators at the onset of complete synchronization, we show that the time interval between bursts in the time dependence of the frequencies of the oscillators exhibits universal scaling and blows up at the critical coupling strength. We also bring out a key mechanism that leads to phase locking. Finally, we deduce forms for the phases and frequencies at the onset of complete synchronization.
Resumo:
The structural engineering community in Brazil faces new challenges with the recent occurrence of high intensity tornados. Satellite surveillance data shows that the area covering the south-east of Brazil, Uruguay and some of Argentina is one of the world most tornado-prone areas, second only to the infamous tornado alley in central United States. The design of structures subject to tornado winds is a typical example of decision making in the presence of uncertainty. Structural design involves finding a good balance between the competing goals of safety and economy. This paper presents a methodology to find the optimum balance between these goals in the presence of uncertainty. In this paper, reliability-based risk optimization is used to find the optimal safety coefficient that minimizes the total expected cost of a steel frame communications tower, subject to extreme storm and tornado wind loads. The technique is not new, but it is applied to a practical problem of increasing interest to Brazilian structural engineers. The problem is formulated in the partial safety factor format used in current design codes, with all additional partial factor introduced to serve as optimization variable. The expected cost of failure (or risk) is defined as the product of a. limit state exceedance probability by a limit state exceedance cost. These costs include costs of repairing, rebuilding, and paying compensation for injury and loss of life. The total expected failure cost is the sum of individual expected costs over all failure modes. The steel frame communications, tower subject of this study has become very common in Brazil due to increasing mobile phone coverage. The study shows that optimum reliability is strongly dependent on the cost (or consequences) of failure. Since failure consequences depend oil actual tower location, it turn,,; out that different optimum designs should be used in different locations. Failure consequences are also different for the different parties involved in the design, construction and operation of the tower. Hence, it is important that risk is well understood by the parties involved, so that proper contracts call be made. The investigation shows that when non-structural terms dominate design costs (e.g, in residential or office buildings) it is not too costly to over-design; this observation is in agreement with the observed practice for non-optimized structural systems. In this situation, is much easier to loose money by under-design. When by under-design. When structural material cost is a significant part of design cost (e.g. concrete dam or bridge), one is likely to lose significantmoney by over-design. In this situation, a cost-risk-benefit optimization analysis is highly recommended. Finally, the study also shows that under time-varying loads like tornados, the optimum reliability is strongly dependent on the selected design life.
Resumo:
An extension of the uniform invariance principle for ordinary differential equations with finite delay is developed. The uniform invariance principle allows the derivative of the auxiliary scalar function V to be positive in some bounded sets of the state space while the classical invariance principle assumes that. V <= 0. As a consequence, the uniform invariance principle can deal with a larger class of problems. The main difficulty to prove an invariance principle for functional differential equations is the fact that flows are defined on an infinite dimensional space and, in such spaces, bounded solutions may not be precompact. This difficulty is overcome by imposing the vector field taking bounded sets into bounded sets.
Resumo:
Compartmental epidemiological models have been developed since the 1920s and successfully applied to study the propagation of infectious diseases. Besides, due to their structure, in the 1960s an interesting version of these models was developed to clarify some aspects of rumor propagation, considering that spreading an infectious disease or disseminating information is analogous phenomena. Here, in an analogy with the SIR (Susceptible-Infected-Removed) epidemiological model, the ISS (Ignorant-Spreader-Stifler) rumor spreading model is studied. By using concepts from the Dynamical Systems Theory, stability of equilibrium points is established, according to propagation parameters and initial conditions. Some numerical experiments are conducted in order to validate the model.
Resumo:
In this paper, we initially present an algorithm for automatic composition of melodies using chaotic dynamical systems. Afterward, we characterize chaotic music in a comprehensive way as comprising three perspectives: musical discrimination, dynamical influence on musical features, and musical perception. With respect to the first perspective, the coherence between generated chaotic melodies (continuous as well as discrete chaotic melodies) and a set of classical reference melodies is characterized by statistical descriptors and melodic measures. The significant differences among the three types of melodies are determined by discriminant analysis. Regarding the second perspective, the influence of dynamical features of chaotic attractors, e.g., Lyapunov exponent, Hurst coefficient, and correlation dimension, on melodic features is determined by canonical correlation analysis. The last perspective is related to perception of originality, complexity, and degree of melodiousness (Euler's gradus suavitatis) of chaotic and classical melodies by nonparametric statistical tests. (c) 2010 American Institute of Physics. [doi: 10.1063/1.3487516]
Resumo:
In the last decade the Sznajd model has been successfully employed in modeling some properties and scale features of both proportional and majority elections. We propose a version of the Sznajd model with a generalized bounded confidence rule-a rule that limits the convincing capability of agents and that is essential to allow coexistence of opinions in the stationary state. With an appropriate choice of parameters it can be reduced to previous models. We solved this model both in a mean-field approach (for an arbitrary number of opinions) and numerically in a Barabaacutesi-Albert network (for three and four opinions), studying the transient and the possible stationary states. We built the phase portrait for the special cases of three and four opinions, defining the attractors and their basins of attraction. Through this analysis, we were able to understand and explain discrepancies between mean-field and simulation results obtained in previous works for the usual Sznajd model with bounded confidence and three opinions. Both the dynamical system approach and our generalized bounded confidence rule are quite general and we think it can be useful to the understanding of other similar models.
Resumo:
We propose and analyze two different Bayesian online algorithms for learning in discrete Hidden Markov Models and compare their performance with the already known Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence as a measure of generalization we draw learning curves in simplified situations for these algorithms and compare their performances.
Resumo:
Biological neuronal networks constitute a special class of dynamical systems, as they are formed by individual geometrical components, namely the neurons. In the existing literature, relatively little attention has been given to the influence of neuron shape on the overall connectivity and dynamics of the emerging networks. The current work addresses this issue by considering simplified neuronal shapes consisting of circular regions (soma/axons) with spokes (dendrites). Networks are grown by placing these patterns randomly in the two-dimensional (2D) plane and establishing connections whenever a piece of dendrite falls inside an axon. Several topological and dynamical properties of the resulting graph are measured, including the degree distribution, clustering coefficients, symmetry of connections, size of the largest connected component, as well as three hierarchical measurements of the local topology. By varying the number of processes of the individual basic patterns, we can quantify relationships between the individual neuronal shape and the topological and dynamical features of the networks. Integrate-and-fire dynamics on these networks is also investigated with respect to transient activation from a source node, indicating that long-range connections play an important role in the propagation of avalanches.
Resumo:
Some properties of the annular billiard under the presence of weak dissipation are studied. We show, in a dissipative system, that the average energy of a particle acquires higher values than its average energy of the conservative case. The creation of attractors, associated with a chaotic dynamics in the conservative regime, both in appropriated regions of the phase space, constitute a generic mechanism to increase the average energy of dynamical systems.
Resumo:
Thanks to recent advances in molecular biology, allied to an ever increasing amount of experimental data, the functional state of thousands of genes can now be extracted simultaneously by using methods such as cDNA microarrays and RNA-Seq. Particularly important related investigations are the modeling and identification of gene regulatory networks from expression data sets. Such a knowledge is fundamental for many applications, such as disease treatment, therapeutic intervention strategies and drugs design, as well as for planning high-throughput new experiments. Methods have been developed for gene networks modeling and identification from expression profiles. However, an important open problem regards how to validate such approaches and its results. This work presents an objective approach for validation of gene network modeling and identification which comprises the following three main aspects: (1) Artificial Gene Networks (AGNs) model generation through theoretical models of complex networks, which is used to simulate temporal expression data; (2) a computational method for gene network identification from the simulated data, which is founded on a feature selection approach where a target gene is fixed and the expression profile is observed for all other genes in order to identify a relevant subset of predictors; and (3) validation of the identified AGN-based network through comparison with the original network. The proposed framework allows several types of AGNs to be generated and used in order to simulate temporal expression data. The results of the network identification method can then be compared to the original network in order to estimate its properties and accuracy. Some of the most important theoretical models of complex networks have been assessed: the uniformly-random Erdos-Renyi (ER), the small-world Watts-Strogatz (WS), the scale-free Barabasi-Albert (BA), and geographical networks (GG). The experimental results indicate that the inference method was sensitive to average degree k variation, decreasing its network recovery rate with the increase of k. The signal size was important for the inference method to get better accuracy in the network identification rate, presenting very good results with small expression profiles. However, the adopted inference method was not sensible to recognize distinct structures of interaction among genes, presenting a similar behavior when applied to different network topologies. In summary, the proposed framework, though simple, was adequate for the validation of the inferred networks by identifying some properties of the evaluated method, which can be extended to other inference methods.
Resumo:
Lipases from different sources, Pseudomonas fluorescens (AK lipase), Burkholderia cepacia (PS lipase), Penicillium camembertii (lipase G) and Porcine pancreas lipase (PPL), previously immobilized on epoxy SiO(2)-PVA, were screened for the synthesis of xylitol monoesters by esterification of the protected xylitol using oleic acid as acyl donor group. Among all immobilized derivatives, the highest esterification yield was achieved by P. camembertii lipase, showing to be attractive alternative to bulk chemical routes to satisfy increasing commercial demands. Further experiments were performed to determine the influence of fatty acids chain size on the reaction yield and the feasibility of using non-conventional heating systems (microwave and ultrasound irradiations) to enhance the reaction rate. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
We consider the two-dimensional Navier-Stokes equations with a time-delayed convective term and a forcing term which contains some hereditary features. Some results on existence and uniqueness of solutions are established. We discuss the asymptotic behaviour of solutions and we also show the exponential stability of stationary solutions.