Fixed point results for multivalued contractions on graphs and their applications

Nous présentons dans cette thèse des théorèmes de point fixe pour des contractions multivoques définies sur des espaces métriques, et, sur des espaces de jauges munis d’un graphe. Nous illustrons également les applications de ces résultats à des inclusions intégrales et à la théorie des fractales. Cette thèse est composée de quatre articles qui sont présentés dans quatre chapitres. Dans le chapitre 1, nous établissons des résultats de point fixe pour des fonctions multivoques, appelées G-contractions faibles. Celles-ci envoient des points connexes dans des points connexes et contractent la longueur des chemins. Les ensembles de points fixes sont étudiés. La propriété d’invariance homotopique d’existence d’un point fixe est également établie pour une famille de Gcontractions multivoques faibles. Dans le chapitre 2, nous établissons l’existence de solutions pour des systèmes d’inclusions intégrales de Hammerstein sous des conditions de type de monotonie mixte. L’existence de solutions pour des systèmes d’inclusions différentielles avec conditions initiales ou conditions aux limites périodiques est également obtenue. Nos résultats s’appuient sur nos théorèmes de point fixe pour des G-contractions multivoques faibles établis au chapitre 1. Dans le chapitre 3, nous appliquons ces mêmes résultats de point fixe aux systèmes de fonctions itérées assujettis à un graphe orienté. Plus précisément, nous construisons un espace métrique muni d’un graphe G et une G-contraction appropriés. En utilisant les points fixes de cette G-contraction, nous obtenons plus d’information sur les attracteurs de ces systèmes de fonctions itérées. Dans le chapitre 4, nous considérons des contractions multivoques définies sur un espace de jauges muni d’un graphe. Nous prouvons un résultat de point fixe pour des fonctions multivoques qui envoient des points connexes dans des points connexes et qui satisfont une condition de contraction généralisée. Ensuite, nous étudions des systèmes infinis de fonctions itérées assujettis à un graphe orienté (H-IIFS). Nous donnons des conditions assurant l’existence d’un attracteur unique à un H-IIFS. Enfin, nous appliquons notre résultat de point fixe pour des contractions multivoques définies sur un espace de jauges muni d’un graphe pour obtenir plus d’information sur l’attracteur d’un H-IIFS. Plus précisément, nous construisons un espace de jauges muni d’un graphe G et une G-contraction appropriés tels que ses points fixes sont des sous-attracteurs du H-IIFS.

On Chaos and Fractals in General Topological Spaces

The present study on chaos and fractals in general topological spaces. Chaos theory originated with the work of Edward Lorenz. The phenomenon which changes order into disorder is known as chaos. Theory of fractals has its origin with the frame work of Benoit Mandelbrot in 1977. Fractals are irregular objects. In this study different properties of topological entropy in chaos spaces are studied, which also include hyper spaces. Topological entropy is a measures to determine the complexity of the space, and compare different chaos spaces. The concept of fractals can’t be extended to general topological space fast it involves Hausdorff dimensions. The relations between hausdorff dimension and packing dimension. Regular sets in Metric spaces using packing measures, regular sets were defined in IR” using Hausdorff measures. In this study some properties of self similar sets and partial self similar sets. We can associate a directed graph to each partial selfsimilar set. Dimension properties of partial self similar sets are studied using this graph. Introduce superself similar sets as a generalization of self similar sets and also prove that chaotic self similar self are dense in hyper space. The study concludes some relationships between different kinds of dimension and fractals. By defining regular sets through packing dimension in the same way as regular sets defined by K. Falconer through Hausdorff dimension, and different properties of regular sets also.

Efectividad en redes Inter-Organizacionales : una aproximación al concepto y su medición

El concepto de efectividad en Redes Inter-organizacionales se ha investigado poco a pesar de la gran importancia en el desarrollo y sostenibilidad de la red. Es muy importante entender este concepto ya que cuando hablamos de Red, nos referimos a un grupo de más de tres organizaciones que trabajan juntas para alcanzar un objetivo colectivo que beneficia a cada miembro de la red. Esto nos demuestra la importancia de evaluar y analizar este fenómeno “Red Inter-organizacional” de forma más detallada para poder analizar que estructura, formas de gobierno, relaciones entre los miembros y entre otros factores, influyen en la efectividad y perdurabilidad de la Red Inter-organizacional. Esta investigación se desarrolla con el fin de plantear una aproximación al concepto de medición de la efectividad en Redes Inter-organizacionales. El trabajo se centrara en la recopilación de información y en la investigación documental, la cual se realizará por fases para brindarle al lector una mayor claridad y entendimiento sobre qué es Red, Red Inter-Organizacional, Efectividad. Y para finalizar se estudiara Efectividad en una Red Inter-organizacional.

Design and synthesis of short antimicrobial peptides for plant protection. Study of their mode of action

Aquesta tesi doctoral està basada en el desenvolupament de nous agents antimicrobians derivats del pèptid híbrid cecropina A-melitina WKLFKKILKVL-NH2 (Pep3) que siguin sostenibles i útils per al control de malalties de plantes. Es van dissenyar i sintetitzar més de 133 anàlegs de Pep3 mitjançant química combinatòria. Es van obtenir anàlegs de Pep3 amb una elevada activitat contra fitopatògens i que presentaven baixa toxicitat. Els millors anàlegs van presentar eficàcies comparables amb pesticides de referència en la prevenció d'infeccions causades per fitopatògens. Es va estudiar el mecanisme d'acció de KKLFKKILKYL-NH2 (BP100) investigant la seva interacció amb models de membrana mitjançant tècniques espectroscòpiques. Es va observar la capacitat de BP100 a induir la permeabilització, la neutralització, i l'agregació de vesícules lipídiques aniòniques a una determinada concentració llindar. Es va deduir una equació que relaciona la CMI d'un pèptid antimicrobià amb la constant de partició i la concentració llindar en la membrana.

Linking the coevolutionary and population dynamics of host-parasitoid interactions

The interplay between coevolutionary and population or community dynamics is currently the focus of much empirical and theoretical consideration. Here, we develop a simulation model to study the coevolutionary and population dynamics of a hypothetical host-parasitoid interaction. In the model, host resistance and parasitoid virulence are allowed to coevolve. We investigate how trade-offs associated with these traits modify the system's coevolutionary and population dynamics. The most important influence on these dynamics comes from the incorporation of density-dependent costs of resistance ability. We find three main outcomes. First, if the costs of resistance are high, then one or both of the players go extinct. Second, when the costs of resistance are intermediate to low, cycling population and coevolutionary dynamics are found, with slower evolutionary changes observed when the costs of virulence are also low. Third, when the costs associated with resistance and virulence are both high, the hosts trade-off resistance against fecundity and invest little in resistance. However, the parasitoids continue to invest in virulence, leading to stable host and parasitoid population sizes. These results support the hypothesis that costs associated with resistance and virulence will maintain the heritable variation in these traits found in natural populations and that the nature of these trade-offs will greatly influence the population dynamics of the interacting species.

Optimization of cable cycles : a trade-off between reliability and cost

This paper elaborates the routing of cable cycle through available routes in a building in order to link a set of devices, in a most reasonable way. Despite of the similarities to other NP-hard routing problems, the only goal is not only to minimize the cost (length of the cycle) but also to increase the reliability of the path (in case of a cable cut) which is assessed by a risk factor. Since there is often a trade-off between the risk and length factors, a criterion for ranking candidates and deciding the most reasonable solution is defined. A set of techniques is proposed to perform an efficient and exact search among candidates. A novel graph is introduced to reduce the search-space, and navigate the search toward feasible and desirable solutions. Moreover, admissible heuristic length estimation helps to early detection of partial cycles which lead to unreasonable solutions. The results show that the method provides solutions which are both technically and financially reasonable. Furthermore, it is proved that the proposed techniques are very efficient in reducing the computational time of the search to a reasonable amount.

MARISA-MDD: uma abordagem para transformações entre modelos orientados a aspectos: dos requisitos ao projeto detalhado

Aspect Oriented approaches associated to different activities of the software development process are, in general, independent and their models and artifacts are not aligned and inserted in a coherent process. In the model driven development, the various models and the correspondence between them are rigorously specified. With the integration of aspect oriented software development (DSOA) and model driven development (MDD) it is possible to automatically propagate models from one activity to another, avoiding the loss of information and important decisions established in each activity. This work presents MARISA-MDD, a strategy based on models that integrate aspect-oriented requirements, architecture and detailed design, using the languages AOV-graph, AspectualACME and aSideML, respectively. MARISA-MDD defines, for each activity, representative models (and corresponding metamodels) and a number of transformations between the models of each language. These transformations have been specified and implemented in ATL (Atlas Definition Language), in the Eclipse environment. MARISA-MDD allows the automatic propagation between AOV-graph, AspectualACME, and aSideML models. To validate the proposed approach two case studies, the Health Watcher and the Mobile Media have been used in the MARISA-MDD environment for the automatic generation of AspectualACME and aSideML models, from the AOV-graph model

Superfluid Bose-Fermi mixture from weak coupling to unitarity

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Efeito da interação reprodutor x rebanho sobre as produções de leite e de gordura na raça Pardo-Suíça

Dados de 4.959 lactações de 2.414 vacas da raça Pardo-Suíça, filhas de 70 reprodutores, distribuídos em 51 rebanhos, foram utilizados para se estimar o componente de variância para a interação reprodutor x rebanho das produções de leite e de gordura e verificar o efeito desta interação sobre a avaliação genética dos reprodutores, por meio de modelos que diferiam na presença e ausência do termo de interação. As produções de leite e de gordura foram ajustadas para duas ordenhas diárias, 305 dias de lactação e idade adulta da vaca. O teste da razão de verossimilhança foi utilizado na verificação da efetividade da inclusão da interação no modelo. As médias das produções de leite e de gordura foram 6085,79 ± 1629,73 kg e 225,61 ± 60,44 kg, respectivamente. A proporção da variância total decorrente da interação reprodutor x rebanho foi 0,4%, para a produção de leite, e 1%, para a produção de gordura. A estimativa de herdabilidade foi 0,38, para a produção de leite, utilizando-se ambos os modelos, e reduziu de 0,40 para 0,39, para a produção de gordura, quando o modelo com interação foi considerado. A função de verossimilhança aumentou significativamente com a inclusão da interação no modelo. A correlação de Spearman foi próxima de um para ambas as características, quando todos os reprodutores foram considerados. Houve redução de 1% na estimativa de acurácia dos valores genéticos preditos para ambas as características, porém, a correlação de Pearson estimada entre as acurácias obtidas para cada modelo estudado foi próxima à unidade. A interaçãoreprodutor x rebanho não afetou as estimativas de componentes de variâncias genética e residual e a ordem de classificação dos reprodutores para ambas as características.

O insumo linguístico oral em aulas de inglês como língua estrangeira para crianças: a fala do professor em foco

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

Estudos das interações do peptídeo antimicrobiano Polybia MP1 com membranas modelo: mecanismo de ação e especificidade

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

Least-cost Disjoint Paths with Dependent Cost Structure in Wavelength Continuous Optical WDM Networks

One of the important issues in establishing a fault tolerant connection in a wavelength division multiplexing optical network is computing a pair of disjoint working and protection paths and a free wavelength along the paths. While most of the earlier research focused only on computing disjoint paths, in this work we consider computing both disjoint paths and a free wavelength along the paths. The concept of dependent cost structure (DCS) of protection paths to enhance their resource sharing ability was proposed in our earlier work. In this work we extend the concept of DCS of protection paths to wavelength continuous networks. We formalize the problem of computing disjoint paths with DCS in wavelength continuous networks and prove that it is NP-complete. We present an iterative heuristic that uses a layered graph model to compute disjoint paths with DCS and identify a free wavelength.

Duality in complex stochastic boolean systems

[EN]Many different complex systems depend on a large number n of mutually independent random Boolean variables. The most useful representation for these systems –usually called complex stochastic Boolean systems (CSBSs)– is the intrinsic order graph. This is a directed graph on 2n vertices, corresponding to the 2n binary n-tuples (u1, . . . , un) ∈ {0, 1} n of 0s and 1s. In this paper, different duality properties of the intrinsic order graph are rigorously analyzed in detail. The results can be applied to many CSBSs arising from any scientific, technical or social area…

Alarm tree analysis using statistical techniques

This work presents a systematic method for the generation and treatment of the alarms' graphs, being its final object to find the Alarm Root Cause of the Massive Alarms that are produced in the dispatching centers. Although many works about this matter have been already developed, the problem about the alarm management in the industry is still completely unsolved. In this paper, a simple statistic analysis of the historical data base is conducted. The results obtained by the acquisition alarm systems, are used to generate a directed graph from which the more significant alarms are extracted, previously analyzing any possible case in which a great quantity of alarms are produced.