Neste trabalho nós estudamos os expoentes de Lyapunov de aplicações f : Td → Td homotópicas a uma aplicação Anosov linear e a continuidade absoluta de folheações. Nós mostramos para algumas classes de homotopia de aplicações que a soma dos expoentes de Lyapunov está limitado pela soma dos expoentes de Lyapunov da aplicação Anosov linear. Além disso, admitindo uma propriedade conhecida como densidade uniformemente limitada (UBD) nas folheações, mostramos uma igualdade entre a soma dos expoentes de Lyapunov de f e do Anosov linear. Também construímos um conjunto C1 aberto de difeomorfismos parcialmente hiperbólicos do toro T4, preservando volume, com folheação central bidimensional não compacta e não absolutamente contínua. Ainda construímos um exemplo parcialmente hiperbólico com folhas centrais bidimensionais, não compactas onde a desintegração do volume ao longo da folheação central não é nem Lebesgue nem atômica. / In this work we study the Lyapunov exponents of maps f : Td → Td homotopic to a linear Anosov map. We proof for some homotopic classes of maps which the sum of Lyapunov exponents is bounded by the sum of the Lyapunov exponents of the linear Anosov map. Moreover, by assuming a property known as uniformly bounded density (UBD) in the foliations, we show an equality between the sum of the Lyapunov exponents of f and the linear Anosov. We also construct an C1 open set of volume preserving partially hyperbolic diffeomorphisms with non compact two dimensional center foliation and non absolutely continuous. We still build an example of partially hyperbolic diffeomorphism with non compact bidimensional center leaves where the disintegration of volume along the center foliation is neither Lebesgue nor atomic.

Nesta tese, exploramos tomada de decisão com preferências parcialmente ordenadas: dadas duas ações, o indivíduo pode preferir uma ação a outra, julgá-las equivalentes, ou julgá-las incomparáveis. Tais preferências são originárias da incerteza sobre determinados estados do modelo de decisão e são reveladas pela imprecisão nos valores de probabilidade. Investigamos seis critérios de escolha de estratégias em problemas de decisão seqüenciais, representados por árvores de decisão e diagramas de influência, com probabilidades imprecisas: T-maximin, T-maximax, T-maximix, Dominação por Intervalos, Maximalidade e E-admissibilidade. Apresentamos novos algoritmos que geram estratégias para todos estes critérios. As principais contribuições deste trabalho estão na implementação dos algoritmos e na análise, sob o ponto de vista computacional, dos diversos critérios considerados como racionais em situações de incerteza representada por conjuntos de probabilidades. / In this thesis we explore situations where preferences are partially ordered: given two acts, the agent may prefer one to another, or nd them to be equivalent, or nd them to be incomparable. Such preferences stem from the uncertainty associated to some states of the decisions model and are revealed by imprecision in probability values. We investigate six criteria for strategy selection in decision trees and inuence diagrams with imprecise probabilities: -maximin, -maximax, -maximix, Interval Dominance, Maximality and E-admissibility. We present new algorithms that generate strategies for all these criteria. The main contributions of this work are twofold: the implementation of these algorithms and the analysis, under the computational point of view, of the criteria considered ratio- nal in uncertain situations represented by set of probabilities.

Este trabalho trata das medidas de máxima entropia para certos difeomorfismos em nilvariedades. Considere um difeomorfismo parcialmente hiperbólico f definido em T3, dinamicamente coerente com folheação central compacta. Suponha ainda que a aplicação induzida por f no espaço das folhas centrais é um homeomorfismo de Anosov transitivo em T2. Mostramos que o conjunto das medidas ergódicas hiperbólicas de máxima entropia é enumerável. Usando o princípio de invariância, mostramos que se o primeiro retorno de f à alguma folha periódica tem número de rotação irracional, então, f tem no máximo duas medidas ergódicas de máxima entropia e ter apenas uma medida de máxima entropia equivale a ser extensão de rotação. Se a aplicação de primeiro retorno à alguma folha central periódica é Morse-Smale, então existe um su-toro periódico, ou temos uma cota superior para o número de medidas ergódicas de máxima entropia que depende do número de atratores da dinâmica nessa folha. Além disso, estudamos a topologia da bacia das medidas ergódicas de máxima entropia para uma outra classe de difeomorfismos especiais que são genéricos no espaço dos difeomorfismos absolutamente parcialmente hiperbólicos e denotada por SPH1(M). / This work is about maximal entropy measures for certain diffeomorphisms on nilmanifolds. Consider a partially hyperbolic diffeomorphism f on T3 , C2 , dinamically coherent with compact center foliation which is a circle bundle. Assume that the map induced by f on the space of center leaves is a transitive Anosov homeomorphism. We show that the set of hyperbolic ergodic maximal entropy measures of f is countable. Using the invariance principle, we show that if the first return map to some periodic leaf has irrational rotation number then f has at most two ergodic maximal entropy measures and, in this case, if f has only one maximal entropy measure then f is a rotation extension. If the first return map to some periodic leaf is Morse-Smale then either there exists some periodic su-torus or an upper bound for the number of ergodic maximal entropy measure depending on the number of the attractors of the dynamics in this leaf. Moreover, we study the topology of basin of ergodic maximal entropy measures of another set of special diffeomorphisms that are generic in the space of absolutely partially hyperbolic systems and denoted by SPH1(M).

Orientador: Jacques Wainer / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-09-11T21:14:07Z (GMT). No. of bitstreams: 1 Pinheiro_PauloGurgel_M.pdf: 1259816 bytes, checksum: a4783df9aa3755becb68ee233ad43e3c (MD5) Previous issue date: 2009 / Resumo: Em um problema de localização multirrobô cooperativa, um grupo de robôs encontra-se em um determinado ambiente, cuja localização exata de cada um dos robôs é desconhecida. Neste cenário, uma distribuição de probabilidades aponta as chances de um robô estar em um determinado estado. É necessário então, que os robôs se movimentem pelo ambiente e gerem novas observações que serão compartilhadas, para calcular novas estimativas. Nos últimos anos, muitos trabalhos têm focado no estudo de técnicas probabilísticas, modelos de comunicação e modelos de detecções, para resolver o problema de localização. No entanto, a movimentação dos robôs é, em geral, definida por ações aleatórias. Ações aleatórias geram observações que podem ser inúteis para a melhoria da estimativa. Este trabalho apresenta uma proposta de localização com suporte a planejamento de ações. O objetivo é apresentar um modelo cujas ações realizadas pelos robôs são definidas por políticas. Escolhendo a melhor ação a ser realizada, é possível receber informações mais úteis dos sensores internos e externos e estimar as posturas mais rapidamente. O modelo proposto, denominado Modelo de Localização Planejada - MLP, utiliza POMDPs para modelar os problemas de localização e algoritmos específicos de geração de políticas. Foi utilizada a localização de Markov como técnica probabilística de localização e implementadas versões de modelos de detecção e propagação de informação. Neste trabalho, um simulador de problemas de localização multirrobô foi desenvolvido, no qual foram realizados experimentos em que o modelo proposto foi comparado a um modelo que não faz uso de planejamento de ações. Os resultados obtidos apontam que o modelo proposto é capaz de estimar as posturas dos robôs com uma menor quantidade de passos, sendo significativamente mais e ciente do que o modelo comparado sem planejamento. / Abstract: In a cooperative multi-robot localization problem, a group of robots is in a certain environment, where the exact location of each robot is unknown. In this scenario, there is only a distribution of probabilities indicating the chance of a robot to be in a particular state. It is necessary for the robots to move in the environment generating new observations, which will be shared to calculate new estimates. Currently, many studies have focused on the study of probabilistic techniques, models of communication and models of detection to solve the localization problem. However, the movement of robots is generally defined by random actions. Random actions generate observations that can be useless for improving the estimate. This work describes a proposal for multi-robot localization with support planning of actions. The objective is to describe a model whose actions performed by robots are defined by policies. Choosing the best action to be performed, the robot gets more useful information from internal and external sensors and estimates the posture more quickly. The proposed model, called Model of Planned Localization - MPL, uses POMDPs to model the problems of location and specific algorithms to generate policies. The Markov localization was used as probabilistic technique of localization and implemented versions of detection models and information propagation model. In this work, a simulator to multi-robot localization problems was developed, in which experiments were performed. The proposed model was compared to a model that does not make use of planning actions. The results showed that the proposed model is able to estimate the positions of robots with lower number of steps, being more e-cient than model compared. / Mestrado / Inteligencia Artificial / Mestre em Ciência da Computação

Novel combustion technologies ensuring low emissions, high efficiency and fuel flexibility are essential to meet the future challenges associated to air pollution, climate change and energy source shortage, as well as to cope with the increasingly stricter environmental regulation. Among them, Moderate or Intense Low oxygen Dilution (MILD) combustion has recently drawn increasing attention. MILD combustion is achieved through the recirculation of flue gases within the reaction region, with the effect of diluting the reactant streams. As a result, the reactivity of the system is reduced, a more uniform reaction zone is obtained, thus leading to decreased NOx and soot emissions. As a consequence of the dilution and enhanced mixing, the ratio between the mixing and chemical time scale is strongly reduced in MILD combustion, indicating the existence of very strong interactions between chemistry and fluid dynamics. In such a context, the use of combustion models that can accurately account for turbulent mixing and detailed chemical kinetics becomes mandatory.Combustion models for conventional flames usually rely on the assumption of time-scale separation (i.e. flamelets and related models), which constrain the thermochemical space accessible in the numerical simulation. Whilst the use of transported PDF methods appears still computationally prohibitive, especially for practical combustion systems, there are a number of closures showing promise for the inclusion of detailed kinetic mechanisms with affordable computational cost. They include the Partially Stirred Reactor (PaSR) approach and the Eddy Dissipation Concept (EDC) model.In order to assess these models under non-conventional MILD combustion conditions, several prototype burners were selected. They include the Adelaide and Delft jet-in-hot coflow (JHC) burners, and the Cabra lifted flames in vitiated coflow. Both Reynolds Averaged Navier Stokes (RANS) and Large Eddy Simulations (LES) were carried out on these burners under various operating conditions and with different fuels. The results indicate the need to explicitly account for both the mixing and chemical time scales in the combustion model formulation. The generalised models developed currently show excellent predictive capabilities when compared with the available, high-fidelity experimental data, especially in their LES formulations. The advanced approaches for the evaluation of the mixing and chemical time scale were compared to several conventional estimation methods, showing their superior performances and wider range of applications. Moreover, the PaSR approach was compared with the steady Flamelet Progress Variable (FPV) model on predicting the lifted Cabra flame, proving that the unsteady behaviours associated to flame extinction and re-ignition should be appropriately considered for such kind of flame.Because of the distributed reaction area, the reacting structures in MILD combustion can be potentially resolved on a Large Eddy Simulation (LES) grid. To investigate that, a comparative study benchmarking the LES predictions for the JHC burner obtained with the PaSR closure and two implicit combustion models was carried out, with the implicit models having filtered source terms coming directly from the Arrhenius expression. Theresults showed that the implicit models are very similar with the conventional PaSR model on predicting the flame properties, for what concerns the mean and root-mean-square of the temperature and species mass fraction fields.To alleviate the cost associated to the use of large kinetic mechanisms, chemistry reduction and tabulation methods to dynamically reduce their size were tested and benchmarked, allowing to allocate the computational resources only where needed. Finally, advanced post-processing tools based on the theory of Computational Singular Perturbation (CSP) were employed to improve the current understanding of flame-turbulence interactions under MILD conditions, confirming the important role of both autoignition and self propagation in these flames. / Doctorat en Sciences de l'ingénieur et technologie / info:eu-repo/semantics/nonPublished

The efficacy of a novel carbohydrate extraction procedure was investigated with methylation analysis and alditol acetate method by Gas Chromatography-Mass Spectrometry. A published extraction procedure for β-glucans was compared to one developed in house. Both procedures gave a dominant glucose peak in the Gas chromatogram indicative of successful β-glucan isolation. Further linkage studies showed four linkage positions for β-glucans isolated with the published method; terminal, 1,3-linkage, 1,6-linkage and 1,3,6-linkage, while β-glucans isolated using the new method showed six linkage positions; terminal, 1,3-linkage, 1,6-linkage, 1,4-linkage, 1,2,3-linkage and 1,3,6-linkage. Diminishing β-glucan linkage peaks in the chromatogram for the published method indicated structure degradation. The results for mannan isolated with 50 mM base gave mannose as a dominant component compared to mannan isolated with 50 mM acid. Base extracted mannan also indicated a good yield of mannan in hyphal form of Candida albicans. This has not been reported with other published isolation methods.

Convex geometries are combinatorial structures; they capture in an abstract way the essential features of convexity in Euclidean space, graphs or posets for instance. A convex geometry consists of a finite ground set plus a collection of subsets, called the convex sets and satisfying certain axioms. In this work, we study two natural problems on convex geometries. First, we consider the maximum-weight convex set problem. After proving a hardness result for the problem, we study a special family of convex geometries built on split graphs. We show that the convex sets of such a convex geometry relate to poset convex geometries constructed from the split graph. We discuss a few consequences, obtaining a simple polynomial-time algorithm to solve the problem on split graphs. Next, we generalize those results and design the first polynomial-time algorithm for the maximum-weight convex set problem in chordal graphs. Second, we consider the realizability problem. We show that deciding if a given convex geometry (encoded by its copoints) results from a point set in the plane is ER-hard. We complete our text with a brief discussion of potential further work. / Doctorat en Sciences / info:eu-repo/semantics/nonPublished

Many material properties depend on specific details of microstructure and both optimal material performance and material reliability often correlate directly to microstructure. In nano- and micro-systems, the material's microstructure has a characteristic length scale that approaches that of the device in which it is used. Fundamental understanding and prediction of material behavior in nano- and micro-systems depend critically on methods for computing the effect of microstructure. Methods for including the physics and spatial attributes of microstructures are presented for a number of materials applications in devices. The research in our group includes applications of computation of macroscopic response of material microstructures, the development of methods for calculating microstructural evolution, and the morphological stability of structures. In this review, research highlights are presented for particular methods for computing the response in: 1) rechargeable lithium ion battery microstructures, 2) photonic composites with anisotropic particulate morphologies, 3) crack deflection in partially devitrified metallic glasses. / Singapore-MIT Alliance (SMA)

Advancements in information technology enabled to track real time data in a more accurate and precise way in many manufacturing facilities. However, before obtaining the more accurate and precise data, the investment in information technology should be validated. Value of information may be adopted as a criterion in this investment. In this study, we analyze the value of information in a manufacturing facility where production and lead time quotation decisions are taken. In order to assess the value of information, two settings are analyzed. Under the first setting, the manufacturer takes decisions under perfect information. To find the optimal decisions under perfect information, a stochastic model is introduced. Under the second setting, the manufacturer takes decisions under imperfect information. To obtain a solution for this problem, Partially Observable Markov Decision Process is employed. Under the second setting, we study two approaches. In the first approach, we introduce a nonlinear programming model to find the optimal decisions. In the second approach, a heuristic approach, constructed on optimal actions taken under perfect information is presented. We examine the value of information under different parameters by considering the policies under nonlinear programming model and heuristic approach. The profit gap between the two policies is investigated. The effect of Make-to-Order (MTO) and Make-to-Stock (MTS) schemes on the value of information is analyzed. Lastly, different lead time quotation schemes / accept-all, accept-reject and precise lead time / are compared to find under which quotation scheme value of information is highest.

In service-oriented environments, services are put together in the form of a workflow with the aim of distributed problem solving. Capturing the execution details of the services' transformations is a significant advantage of using workflows. These execution details, referred to as provenance information, are usually traced automatically and stored in provenance stores. Provenance data contains the data recorded by a workflow engine during a workflow execution. It identifies what data is passed between services, which services are involved, and how results are eventually generated for particular sets of input values. Provenance information is of great importance and has found its way through areas in computer science such as: Bioinformatics, database, social, sensor networks, etc. Current exploitation and application of provenance data is very limited as provenance systems started being developed for specific applications. Thus, applying learning and knowledge discovery methods to provenance data can provide rich and useful information on workflows and services. Therefore, in this work, the challenges with workflows and services are studied to discover the possibilities and benefits of providing solutions by using provenance data. A multifunctional architecture is presented which addresses the workflow and service issues by exploiting provenance data. These challenges include workflow composition, abstract workflow selection, refinement, evaluation, and graph model extraction. The specific contribution of the proposed architecture is its novelty in providing a basis for taking advantage of the previous execution details of services and workflows along with artificial intelligence and knowledge management techniques to resolve the major challenges regarding workflows. The presented architecture is application-independent and could be deployed in any area. The requirements for such an architecture along with its building components are discussed. Furthermore, the responsibility of the components, related works and the implementation details of the architecture along with each component are presented.