921 resultados para topological complexity


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The dynamics of catalytic networks have been widely studied over the last decades because of their implications in several fields like prebiotic evolution, virology, neural networks, immunology or ecology. One of the most studied mathematical bodies for catalytic networks was initially formulated in the context of prebiotic evolution, by means of the hypercycle theory. The hypercycle is a set of self-replicating species able to catalyze other replicator species within a cyclic architecture. Hypercyclic organization might arise from a quasispecies as a way to increase the informational containt surpassing the so-called error threshold. The catalytic coupling between replicators makes all the species to behave like a single and coherent evolutionary multimolecular unit. The inherent nonlinearities of catalytic interactions are responsible for the emergence of several types of dynamics, among them, chaos. In this article we begin with a brief review of the hypercycle theory focusing on its evolutionary implications as well as on different dynamics associated to different types of small catalytic networks. Then we study the properties of chaotic hypercycles with error-prone replication with symbolic dynamics theory, characterizing, by means of the theory of topological Markov chains, the topological entropy and the periods of the orbits of unimodal-like iterated maps obtained from the strange attractor. We will focus our study on some key parameters responsible for the structure of the catalytic network: mutation rates, autocatalytic and cross-catalytic interactions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertation submitted in partial fulfilment of the requirements for the Degree of Master of Science in Geospatial Technologies

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Background: Complex medication regimens may adversely affect compliance and treatment outcomes. Complexity can be assessed with the medication regimen complexity index (MRCI), which has proved to be a valid, reliable tool, with potential uses in both practice and research. Objective: To use the MRCI to assess medication regimen complexity in institutionalized elderly people. Setting: Five nursing homes in mainland Portugal. Methods: A descriptive, cross-sectional study of institutionalized elderly people (n = 415) was performed from March to June 2009, including all inpatients aged 65 and over taking at least one medication per day. Main outcome measure: Medication regimen complexity index. Results: The mean age of the sample was 83.9 years (±6.6 years), and 60.2 % were women. The elderly patients were taking a large number of drugs, with 76.6 % taking more than five medications per day. The average medication regimen complexity was 18.2 (±SD = 9.6), and was higher in the females (p < 0.001). The most decisive factors contributing to the complexity were the number of drugs and dosage frequency. In regimens with the same number of medications, schedule was the most relevant factor in the final score (r = 0.922), followed by pharmaceutical forms (r = 0.768) and additional instructions (r = 0.742). Conclusion: Medication regimen complexity proved to be high. There is certainly potential for the pharmacist's intervention to reduce it as part as the medication review routine in all the patients.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Coevolution between two antagonistic species has been widely studied theoretically for both ecologically- and genetically-driven Red Queen dynamics. A typical outcome of these systems is an oscillatory behavior causing an endless series of one species adaptation and others counter-adaptation. More recently, a mathematical model combining a three-species food chain system with an adaptive dynamics approach revealed genetically driven chaotic Red Queen coevolution. In the present article, we analyze this mathematical model mainly focusing on the impact of species rates of evolution (mutation rates) in the dynamics. Firstly, we analytically proof the boundedness of the trajectories of the chaotic attractor. The complexity of the coupling between the dynamical variables is quantified using observability indices. By using symbolic dynamics theory, we quantify the complexity of genetically driven Red Queen chaos computing the topological entropy of existing one-dimensional iterated maps using Markov partitions. Co-dimensional two bifurcation diagrams are also built from the period ordering of the orbits of the maps. Then, we study the predictability of the Red Queen chaos, found in narrow regions of mutation rates. To extend the previous analyses, we also computed the likeliness of finding chaos in a given region of the parameter space varying other model parameters simultaneously. Such analyses allowed us to compute a mean predictability measure for the system in the explored region of the parameter space. We found that genetically driven Red Queen chaos, although being restricted to small regions of the analyzed parameter space, might be highly unpredictable.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this work, we associate a p-periodic nonautonomous graph to each p-periodic nonautonomous Lorenz system with finite critical orbits. We develop Perron-Frobenius theory for nonautonomous graphs and use it to calculate their entropy. Finally, we prove that the topological entropy of a p-periodic nonautonomous Lorenz system is equal to the entropy of its associated nonautonomous graph.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

“In the midst of order, there is chaos; but in the midst of chaos, there is order”, John Gribbin wrote in his book Deep Simplicity (p.76). In this dialectical spirit, we discuss the generative tension between complexity and simplicity in the theory and practice of management and organization. Complexity theory suggests that the relationship between complex environments and complex organizations advanced by the well-known Ashby’s law, may be reconsidered: only simple organization provides enough space for individual agency to match environmental turbulence in the form of complex organizational responses. We suggest that complex organizing may be paradoxically facilitated by a simple infrastructure, and that the theory of organizations may be viewed as resulting from the interplay between simplicity and complexity.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The purpose of this study is to contribute to the changing innovation management literature by providing an overview of different innovation types and organizational complexity factors. Aiming at a better understanding of effective innovation management, innovation and complexity are related to the formulation of an innovation strategy and interaction between different innovation types is further explored. The chosen approach in this study is to review the existing literature on different innovation types and organizational complexity factors in order to design a survey which allows for statistical measurement of their interactions and relationships to innovation strategy formulation. The findings demonstrate interaction between individual innovation types. Additionally, organizational complexity factors and different innovation types are significantly related to innovation strategy formulation. In particular, more closed innovation and incremental innovation positively influence the likelihood of innovation strategy formulation. Organizational complexity factors have an overall negative influence on innovation strategy formulation. In order to define best practices for innovation management and to guide managerial decision making, organizations need to be aware of the co-existence of different innovation types and formulate an innovation strategy to more closely align their innovation objectives.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Tese de Doutoramento em Contabilidade.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Higher-dimensional automata constitute a very expressive model for concurrent systems. In this paper, we discuss ``topological abstraction" of higher-dimensional automata, i.e., the replacement of HDAs by smaller ones that can be considered equivalent from the point of view of both computer science and topology. By definition, topological abstraction preserves the homotopy type, the trace category, and the homology graph of an HDA. We establish conditions under which cube collapses yield topological abstractions of HDAs.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

FUNDAMENTO: A complexidade da farmacoterapia consiste de múltiplas características do regime prescrito, incluindo o número de diferentes medicações no esquema, o número de unidades de dosagem por dose, o número total de doses por dia e os cuidados na administração dos medicamentos. O Medication Regimen Complexity Index (MRCI) é um instrumento específico, validado e utilizado para medir a complexidade da farmacoterapia, desenvolvido originalmente em língua inglesa. OBJETIVO: Tradução transcultural e validação desse instrumento para o português do Brasil. MÉTODOS: Foi desenvolvido um estudo transversal envolvendo 95 pacientes com diabete do tipo 2 utilizando múltiplas medicações. O processo de validação teve início pela tradução, retrotradução e pré-teste do instrumento, gerando uma versão adaptada chamada Índice de Complexidade da Farmacoterapia (ICFT). Em seguida foram analisados parâmetros psicométricos, incluindo validade convergente, validade divergente, confiabilidade entre avaliadores e teste-reteste. RESULTADOS: A complexidade da farmacoterapia medida pelo ICFT obteve média de 15,7 pontos (desvio padrão = 8,36). O ICFT mostrou correlação significativa com o número de medicamentos em uso (r = 0,86; p < 0,001) e a idade dos pacientes (r = 0,28; p = 0,005). A confiabilidade entre avaliadores obteve correlação intraclasse igual a 0,99 (p < 0,001) e a confiabilidade teste-reteste obteve correlação de 0,997 (p < 0,001). CONCLUSÃO: Os resultados demonstraram que o ICFT apresenta bom desempenho de validade e confiabilidade, podendo ser utilizado como ferramenta útil na prática clínica e em pesquisas envolvendo análise da complexidade da terapia.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

feature extraction, feature tracking, vector field visualization

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F, there is an endomorphism Φ of F sending W to U. This work analyzes an approach due to C. Edmunds and improved by C. Sims. Here we prove that the approach provides an efficient algorithm for solving the endomorphism problem when W is a two- generator word. We show that when W is a two-generator word this algorithm solves the problem in time polynomial in the length of U. This result gives a polynomial-time algorithm for solving, in free groups, two-variable equations in which all the variables occur on one side of the equality and all the constants on the other side.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Vegeu el resum a l'inici del document del fitxer adjunt.