This work introduces a time adaptive strategy that uses a refinement estimator based on the geometric indicator of curvature. The developed methodology is suitable for problems of numerical time integration present, for example, in the study of bodies subjected to dynamical loads. The refinement estimator demands low computational resources, being easily applied to several direct integration methods. Trying to interact these methods, an object oriented library that uses the developed scheme of adaptation is built. The main idea of this tool is to incorporate this scheme, in an easy way, in existing computational codes that employ direct integration methods. Examples of dynamic solid bodies are presented, ilustrating the technique and library usage in existing applications. / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Este trabalho introduz uma estratégia de adaptação no tempo que utiliza um estimador de refinamento baseado no indicador geométrico curvatura. A metodologia desenvolvida é aplicada ao problema de integração numérica temporal, presente, por exemplo, no estudo do comportamento de corpos submetidos a cargas dinâmicas. O estimador de refinamento formulado demanda pouco esforço computacional, sendo facilmente aplicado aos diversos métodos de integração direta existentes. Visando a interação com esses métodos, constrói-se uma biblioteca orientada a objetos que incorpora a técnica de adaptação desenvolvida. A idéia principal desta ferramenta é prover, de forma fácil, a técnica de adaptação concebida a códigos computacionais existentes e que fazem uso dos referidos métodos de integração. Apresentam-se exemplos de dinâmica de corpos sólidos que ilustram o potencial de utilização da técnica e o uso da biblioteca em aplicações existentes.

Submitted by Aline Santiago da Silva Santos (aline.santos@fgv.br) on 2010-05-17T18:39:00Z No. of bitstreams: 1 CPDOC2010RenatoLannaFernandez.pdf: 6432291 bytes, checksum: 21ba1a50f5971ef250587ee48960f4be (MD5) / Approved for entry into archive by Suemi Higuchi(suemi.higuchi@fgv.br) on 2010-05-17T20:12:55Z (GMT) No. of bitstreams: 1 CPDOC2010RenatoLannaFernandez.pdf: 6432291 bytes, checksum: 21ba1a50f5971ef250587ee48960f4be (MD5) / Made available in DSpace on 2010-05-18T12:40:43Z (GMT). No. of bitstreams: 1 CPDOC2010RenatoLannaFernandez.pdf: 6432291 bytes, checksum: 21ba1a50f5971ef250587ee48960f4be (MD5) Previous issue date: 2010-03-29 / The purpose of this dissertation is to explain the formation of the identity of Fluminense F.C. as a club marked by elitism, which is grounded on distinction and refinement. An attempt was made to analyze the history of this club during the earliest years of the soccer development in Rio de Janeiro city, and its relation with other clubs. Several peculiar aspects of its history that were essential for the construction of the image of the club are also discussed. As theoretical basis, this dissertation shows Bourdieu’s ideas about distinction and Hobsbawm & Ranger’s ideas about invention of traditions. These ideas are necessary in order to demonstrate how writers as Mario Filho and Paulo Coelho Netto were responsible for the construction of a series of symbolic values and traditions, which associated the 'Fluminense' club with a space of distinction and refinement that perpetuated historically. / Este trabalho tem por objetivo levantar explicações sobre a formação da identidade do Fluminense F. C. como clube que tem como marca principal a elitização calcada na distinção e no refinamento. Pretendemos analisar a história do clube durante os anos iniciais do desenvolvimento do futebol na cidade do Rio de Janeiro e sua relação com as outras agremiações futebolísticas, levantando aspectos peculiares de sua história que foram fundamentais na construção dessa imagem. Tendo como pressupostos teóricos os trabalhos de Bourdieu sobre a distinção e de Hobsbawm e Ranger sobre a invenção das tradições, procuramos demonstrar como escritores como Mario Filho e Paulo Coelho Netto foram responsáveis pela consolidação de uma série de valores simbólicos e tradições que associaram o Fluminense a um espaço de distinção e refinamento que se perpetuou historicamente.

HORTÊNCIO FILHO, Fernando Wagner Brito. Uma Abordagem Semi-automática para Geração Incremental de Correspondências entre Ontologias. 2011. 81 f. : Dissertação (mestrado) - Universidade Federal do Ceará, Centro de Ciências, Departamento de Computação, Fortaleza-CE, 2011. / Submitted by guaracy araujo (guaraa3355@gmail.com) on 2016-06-27T19:11:59Z No. of bitstreams: 1 2011_dis_fwbhortênciofilho.pdf: 2807164 bytes, checksum: f2d22503112321ee69d172f0ac56d4c8 (MD5) / Approved for entry into archive by guaracy araujo (guaraa3355@gmail.com) on 2016-06-27T19:14:07Z (GMT) No. of bitstreams: 1 2011_dis_fwbhortênciofilho.pdf: 2807164 bytes, checksum: f2d22503112321ee69d172f0ac56d4c8 (MD5) / Made available in DSpace on 2016-06-27T19:14:07Z (GMT). No. of bitstreams: 1 2011_dis_fwbhortênciofilho.pdf: 2807164 bytes, checksum: f2d22503112321ee69d172f0ac56d4c8 (MD5) Previous issue date: 2011 / The discovery of semantic correspondences between schemas is an important task for different fields of applications such as data integration, data warehousing and data mashup. In most cases, the data sources involved are heterogeneous and dynamic, making it even harder the performance of that task. Ontologies are being used in order to define common vocabulary used to describe the elements of the schemas involved in a particular application. The problem of matching between ontologies, or ontology matching, consists in the discovery of correspondences between terms of vocabularies (represented by ontologies) used between the various applications. The solutions proposed in the literature, despite being fully automatic have heuristic nature, and may produce non-satisfactory results. The problem intensifies when dealing with large data sources. The purpose of this paper is to propose a method for generation and incremental refinement of correspondences between ontologies. The proposed approach makes use of filtering techniques of ontologies, as well as user feedback to support the generation and refining these matches. For validation purposes, a tool was developed and experiments were conducted / A descoberta de correspondências semânticas entre esquemas é uma importante tarefa para diversos domínios de aplicações, tais como integração de dados, data warehouse e mashup de dados. Na maioria dos casos, as fontes de dados envolvidas são heterogêneas e dinâmicas, dificultando ainda mais a realização dessa tarefa. Ontologias vêm sendo utilizadas no intuito de definir vocabulários comuns usados para descrever os elementos dos esquemas envolvidos em uma determinada aplicação. O problema de matching entre ontologias, ou ontology matching, consiste na descoberta de correspondências entre os termos dos vocabulários (representados por ontologias) usados entre as diversas aplicações. As soluções propostas na literatura, apesar de serem totalmente automáticas possuem natureza heurística, podendo produzir resultados não-satisfatórios. O problema se intensifica quando se lida com grandes fontes de dados. O objetivo deste trabalho é propor um método para geração e refinamento incremental de correspondências entre ontologias. A abordagem proposta faz uso de técnicas de filtragem de ontologias, bem como do feedback do usuário para dar suporte à geração e ao refinamento dessas correspondências. Para fins de validação, uma ferramenta foi desenvolvida e experimentos foram realizados.

A deductive, descriptive, quanitative study was undertaken at Nyangabgwe Hospital, Francistown, Botswana, situated in the north east of the country. Its focus was on the use of partogram by midwives. The population consisted of 395 obstetric records for the period of one month. A sample of 303 obstetrics records was drawn. Data were collected through auditing the bed letters of delivered mothers and interviews with and observation of midwives using the partogram in practice. The Statistical Package for Social Sciences (SPSS) program was used to analyse the data. The findings indicate that there are problems regarding, and factors that can have a negative influence on the use of the partogram by midwives. It is suggested that a supportive teaching programme for the midwives should be designed, that will support the system of supervision in the labour ward that already exists, in the use of the partogram throughout the labour process. / Health Studies / M.A. (Advanced Nursing Sciences)

Dans cette thèse, nous présentons des approches formelles permettant de simplifier la modélisation et la preuve du calcul distribué. Un système distribué est défini par une collection d’entités de calcul autonomes,qui communiquent ensemble pour accomplir une tâche commune. Chaque entité exécute localement son calcul et ne peut interagir qu’avec ses voisins.Le développement et la preuve du calcul distribué est un défi qui nécessite l’utilisation de méthodes et outils avancés. Dans nos travaux de thèse,nous étudions quelques problèmes fondamentaux du distribués, en utilisant Event-B, et nous proposons des schémas de preuve basés sur une approche“correct-par-construction”. Nous considérons un système distribué défini par réseau fiable, de processus anonymes et avec un modèle de communication basé sur l’échange de messages. Dans certains cas, nous faisons abstraction du modèle de communications en utilisant le modèle des calculs locaux. Nous nous focalisons d’abord sur le problème de détection de terminaison du calcul distribué. Nous proposons un patron formel permettant de transformer des algorithmes “avec détection de terminaison locale” en des algorithmes“avec détection de terminaison globale”. Ensuite, nous explicitons les preuves de correction d’un algorithme d’énumération. Nous proposons un développement formel qui servirait de point de départ aux calculs qui nécessitent l’hypothèse d’identification unique des processus. Enfin, nous étudions le problème du snapshot et du calcul d’état global. Nous proposons une solution basée sur une composition d’algorithmes existants. / In this work, we propose formal approaches for modeling andproving distributed algorithms. Such computations are designed to run oninterconnected autonomous computing entities for achieving a common task :each entity executes asynchronously the same code and interacts locally withits immediate neighbors. Correctness of distributed algorithms is a difficulttask and requires advancing methods and tools. In this thesis, we focus onsome basic problems of distributed computing, and we propose Event-B solutionsbased on the ”correct-by-construction” approach. We consider reliablesystems. We also assume that the network is anonymous and processes communicatewith asynchronous messages. In some cases, we refer to local computationsmodel to provide an abstraction of the distributed computations.We propose a formal framework enhancing the termination detection propertyof distributed algorithms. By relying on refinement and composition,we show that an algorithm specified with “local termination detection”, canbe reused in order to compute the same algorithm with “global terminationdetection”. We then focus on the enumeration problem : we start with anabstract initial specification of the problem, and we enrich it gradually bya progressive and incremental refinement. The computed result constitutesbasic initial steps of others distributed algorithms which assume that processeshave unique identifiers. We therefore focus on snapshot problems, andwe propose to investigate how existing algorithms can be composed, withrefinement, in order to compute a global state in an anonymous network.

Cette thèse traite des méthodes d’éléments finis Galerkin discontinus d’ordre élevé pour la résolution d’équations aux dérivées partielles, avec un intérêt particulier pour l’équation de transport des neutrons. Nous nous intéressons tout d’abord à une méthode de pré-traitement de matrices creuses par blocs, qu’on retrouve dans les méthodes Galerkin discontinues, avant factorisation par un solveur multifrontal. Des expériences numériques conduites sur de grandes matrices bi- et tri-dimensionnelles montrent que cette méthode de pré-traitement permet une réduction significative du ’fill-in’, par rapport aux méthodes n’exploitant pas la structure par blocs. Ensuite, nous proposons une méthode d’éléments finis Galerkin discontinus, employant des éléments d’ordre élevé en espace comme en angle, pour résoudre l’équation de transport des neutrons. Nous considérons des solveurs parallèles basés sur les sous-espaces de Krylov à la fois pour des problèmes ’source’ et des problèmes aux valeur propre multiplicatif. Dans cet algorithme, l’erreur est décomposée par projection(s) afin d’équilibrer les contraintes numériques entre les parties spatiales et angulaires du domaine de calcul. Enfin, un algorithme HP-adaptatif est présenté ; les résultats obtenus démontrent une nette supériorité par rapport aux algorithmes h-adaptatifs, à la fois en terme de réduction de coût de calcul et d’amélioration de la précision. Les valeurs propres et effectivités sont présentées pour un panel de cas test industriels. Une estimation précise de l’erreur (avec effectivité de 1) est atteinte pour un ensemble de problèmes aux domaines inhomogènes et de formes irrégulières ainsi que des groupes d’énergie multiples. Nous montrons numériquement que l’algorithme HP-adaptatif atteint une convergence exponentielle par rapport au nombre de degrés de liberté de l’espace éléments finis. / We consider high order discontinuous-Galerkin finite element methods for partial differential equations, with a focus on the neutron transport equation. We begin by examining a method for preprocessing block-sparse matrices, of the type that arise from discontinuous-Galerkin methods, prior to factorisation by a multifrontal solver. Numerical experiments on large two and three dimensional matrices show that this pre-processing method achieves a significant reduction in fill-in, when compared to methods that fail to exploit block structures. A discontinuous-Galerkin finite element method for the neutron transport equation is derived that employs high order finite elements in both space and angle. Parallel Krylov subspace based solvers are considered for both source problems and $k_{eff}$-eigenvalue problems. An a-posteriori error estimator is derived and implemented as part of an h-adaptive mesh refinement algorithm for neutron transport $k_{eff}$-eigenvalue problems. This algorithm employs a projection-based error splitting in order to balance the computational requirements between the spatial and angular parts of the computational domain. An hp-adaptive algorithm is presented and results are collected that demonstrate greatly improved efficiency compared to the h-adaptive algorithm, both in terms of reduced computational expense and enhanced accuracy. Computed eigenvalues and effectivities are presented for a variety of challenging industrial benchmarks. Accurate error estimation (with effectivities of 1) is demonstrated for a collection of problems with inhomogeneous, irregularly shaped spatial domains as well as multiple energy groups. Numerical results are presented showing that the hp-refinement algorithm can achieve exponential convergence with respect to the number of degrees of freedom in the finite element space

Les systèmes informatiques sont construits par composition de plusieurs sous-systèmes répartis. La manière dont communiquent ces entités, ou pairs, joue un rôle clé dans la bonne marche du système composé. L'étude détaillée de ces interactions est donc essentielle dans le cadre de la vérification et du développement formel de tels systèmes. Ces interactions se décomposent en deux catégories: la communication synchrone et la communication asynchrone. La communication synchrone admet une transmission instantanée de l'information, le message, entre deux entités. La communication asynchrone, en revanche, prend en compte le découplage de la transmission du message en une opération d'envoi puis de réception avec la possibilité que des événements s'intercalent entre les deux donnant ainsi lieu à des variations de comportement, désirables ou non, des systèmes. Souvent considérée comme une entité monolithique duale du monde synchrone, le monde asynchrone se décline en réalité en de multiples modèles qui peuvent induire sur la communication une grande variété de propriétés qu'il convient de caractériser et comparer. Cette thèse se focalise sur les modèles de communication qui orchestrent l'ordre de délivrance des messages : par exemple les modèles dits FIFO qui assurent que certains messages sont reçus dans l'ordre dans lequel ils ont été émis. Nous considérons des modèles de communication classiques de la littérature ainsi que des variations de ces modèles dont nous explicitons les différences parfois négligées. Dans un premier temps nous proposons une formalisation logique abstraite et homogène des modèles de communication considérés et nous les hiérarchisons en étendant des résultats existants. Nous proposons dans un second temps une approche opérationnelle sous forme d'un outil de vérification de compositions de pairs que nous mécanisons à l'aide du langage de spécification TLA+ et du vérificateur de modèles TLC. Cet outil permet de spécifier des pairs communicants et des propriétés temporelles à vérifier pour les différents modèles de communication de façon modulaire. Pour cela, nous apportons un ensemble de spécifications uniformes et opérationnelles des modèles de communication basé sur la notion d'histoires de messages. Nous identifions et prouvons les conditions de leur conformité aux définitions logiques et validons ainsi la pertinence de notre outil. Dans un troisième temps nous considérons des spécifications concrètes de nos modèles de communication, semblables à nombre de celles présentes dans la littérature. Nous disposons donc d'une hiérarchisation des modèles selon les propriétés d'ordre qu'ils garantissent mais également d'une autre hiérarchisation pour un modèle donné entre sa définition logique abstraite et ses implantations concrètes. Ces deux dimensions correspondent à deux dimensions du raffinement. Nous introduisons graduellement par raffinement la notion de communication asynchrone point à point et prouvons, grâce à la méthode Event-B, tous les liens de raffinement entre les différents modèles de communication et leurs déclinaisons. Nous offrons ainsi une cartographie détaillée des modèles pouvant être utilisée pour en développer de nouveaux ou identifier les modèles les plus adaptés à des besoins donnés. Enfin, nous proposons des pistes d'extension de nos travaux à la communication par diffusion où un message peut être envoyé simultanément à plusieurs destinataires. En particulier, nous montrons les différences induites dans la hiérarchie des modèles et les adaptations à effectuer sur notre outil de vérification pour prendre en compte ce mode de communication / Large computing systems are generally built by connecting several distributed subsystems. The way these entities communicate is crucial to the proper functioning of the overall composed system. An in-depth study of these interactions makes sense in the context of the formal development and verification of such systems. The interactions fall in two categories: synchronous and asynchronous communication. In synchronous communication, the transmission of a piece of information - the message - is instantaneous. Asynchronous communication, on the other hand, splits the transmission in a send operation and a receive operation. This make the interleaving of other events possible and lead to new behaviours that may or may not be desirable. The asynchronous world is often viewed as a monolithic counterpart of the synchronous world. It actually comes in multiple models that provide a wide range of properties that can be studied and compared. This thesis focuses on communication models that order the delivery of messages: for instance, the "FIFO" models ensure that some messages are received in the order of their emission. We consider classic communication models from the literature as well as a few variations. We highlight the differences that are sometimes overlooked. First, we propose an abstract, logical, and homogeneous formalisation of the communication models and we establish a hierarchy that extends existing results. Second, we provide an operational approach with a tool that verifies the compatibility of compositions of peers. We mechanise this tool with the TLA+ specification language and its model checker TLC. The tool is designed in a modular fashion: the commmunicating peers, the temporal compatibility properties, and the communication models are specified independently. We rely on a set of uniform operational specifications of the communication models that are based on the concept of message history. We identify and prove the conditions under which they conform to the logical definitions and thus show the tool is trustworthy. Third, we consider concrete specifications of the communication models that are often found in the literature. Thus, the models are classified in terms of ordering properties and according to the level of abstraction of the different specifications. The concept of refinement covers these two aspects. Thus, we model asynchronous point-to-point communication along several levels of refinement and then, with the Event-B method, we establish and prove all the refinements between the communication models and the alternative specifications of each given model. This work results in a detailed map one can use to develop a new model or find the one that best fits given needs. Eventually we explore ways to extend our work to multicast communication that consists in sending messages to several recipients at once. In particular, we highlight the differences in the hierarchy of the models and how we modify our verification tool to handle this communication paradigm.

[pt] Como um novo e poderoso paradigma para modelagem e implementação de sistemas de software, os sistemas multiagentes necessitam de metodologias, linguagens de modelagem, plataformas de desenvolvimento e linguagens de programação que explorem seus benefícios e características particulares. Contudo, diferentes metodologias, linguagens e plataformas para sistemas multiagentes propõem abstrações variadas e com definições muito diferentes. Nesse contexto, é necessário criar frameworks conceituais que definam as abstrações, seus relacionamentos e seus comportamentos. Como em qualquer novo paradigma para engenharia de software, o sucesso e a difusão de sistemas multiagentes requerem, entre outras tecnologias de software baseadas em agentes, linguagens de modelagem que explorem o uso de abstrações relacionadas a agentes e promovam o refinamento dos modelos de design para código. Esta tese contempla a definição de um framework conceitual para sistemas multiagentes chamado TAO e uma linguagem de modelagem para sistemas multiagentes chamada MAS-ML. Os objetivos desta tese são descrever os aspectos estáticos e dinâmicos das abstrações freqüentemente utilizadas em sistemas multiagentes definindo um framework conceitual, propor uma linguagem de modelagem que descreva diagramas estáticos e dinâmicos para modelar esses aspectos e descrever o refinamento dos modelos estáticos para código. / [en] As a powerful and new paradigm for designing and implementing software systems, multi-agent systems require methodologies, modeling languages, development platforms and programming languages that explore their benefits and their peculiar characteristics. However, different methodologies, languages and platforms for multi-agent systems propose very distinct and varied sets of abstraction. In this context, there is a need for creating a conceptual framework that defines the frequently used multi-agent system abstractions, their relationships and their behavior. As it is the case with any new software engineering paradigm, the successful and widespread deployment of multi-agent systems require modeling languages, among other agent-based software technologies, that explore the use of agentrelated abstractions and promote the traceability from the design models to code. This thesis contemplates the definition of a multi-agent system conceptual framework called TAO and of a multi-agent system modeling language called MAS-ML. Our goals are to describe the structural and dynamic aspects of the abstractions commonly used in multi-agent systems by defining a conceptual framework, to propose a modeling language that describes structural and dynamic diagrams to model such aspects and to present the traceability from the structural models into code.

Recentemente introduzida no mercado, a liga à base de titânio β-metaestável Ti-5Al-5V-5Mo3Cr-1Zr (Ti-55531) é um material estrutural para aplicações nos setores automotivo e aéreo, além de compor peças para centrífugas. A presente Dissertação de Mestrado tem como objetivo o estudo in situ das transformações de fase em estado sólido da liga Ti-55531 durante o envelhecimento a diferentes temperaturas e condições iniciais por meio de refinamento Rietveld. A ênfase do projeto será a análise qualitativa e quantitativa das principais fases presentes nesta liga, em especial aquelas β de estrutura cúbica de corpo centrado, alfa (α) e ômega (ω) de estrutura hexagonal e martensita (α\'\') de estrutura ortorrômbica. Os padrões de difração desta liga para os diferentes tempos de envelhecimento foram obtidas com o auxílio da técnica de difração de raio-X de alta energia in situ utilizando luz síncrotron, enquanto que as respectivas análises das imagens dos anéis de difração a partir destes experimentos foram realizadas com o auxílio do programa de integração e calibração instrumental FIT2D e do programa de análise de materiais usando difração (do inglês MAUD). / Recently introduced, the new Ti-55531 titanium based alloy has been developed aiming structural applications such as the automotive and aerospace ones. The present Thesis is focused on the assessment of Ti-55531 alloy in situ solid state transformations during ageing at diferente temperatures as well as initial conditions. In this sense, the study emphasis will deal with both quantitative and qualitative analysis of the main constitutive phases found in the alloy, namely the body-centered cubic β, both hexagonal α and ω and the martensitic α\'\', this one orthorhombic, by means of Rietveld refinement. Concerning the data, it was obtained by high energy X-ray diffraction (HEXRD) technique in a synchrotron light source facility. All the Debye-Scherrer rings resulting from these in situ experiments were analyzed by both FIT2D and MAUD software.

Made available in DSpace on 2014-12-17T14:25:23Z (GMT). No. of bitstreams: 1 MaraRWV_TESE.pdf: 3541177 bytes, checksum: 2415c9163a59f9b397912f22608eefbc (MD5) Previous issue date: 2014-05-29 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / This thesis aimed to assess the increase in solubility of simvastatin (SINV) with solid dispersions using techniques such as kneading (MA), co-solvent evaporation (ES), melting carrier (FC) and spray dryer (SD). Soluplus (SOL), PEG 6000 (PEG), PVP K-30 (PVP) e sodium lauryl sulphate (LSS) were used as carriers. The solid dispersions containing PEG [PEG-2(SD)], Soluplus [SOL-2(MA)] and sodium lauryl sulphate [LSS-2(ES)] were presented with a greater increase in solubility (5.02, 5.60 and 5.43 times respectively); analyses by ANOVA between the three groups did not present significant difference (p<0.05). In the phase solubility study, the calculation of the Gibbs free energy (&#916;G) revealed that the spontaneity of solubilisation of SINV occurred in the order SOL>PEG >PVP 75%>LSS, always 80%. The phase diagrams of PEG and LSS presented solubilization stoichiometry of type 1:1 (type AL). The diagrams with PVP and SOL tend to 1:2 stoichiometry (type AL + AP). The stability coefficients (Ks) of the phase diagrams revealed that the most stable reactions occurred with LSS and PVP. The solid dispersions were characterized by Fourier transform infrared (FTIR), differential scanning calorimetry (DSC), scanning electron microscopy (SEM), particle size distribution (PSD), near-infrared spectroscopy imaging (NIR-CI) and X-ray diffraction of the powder using the Topas software (PDRX-TOPAS). The solid dispersion PEG-2(SD) presented the greatest homogeneity and the lowest degree of crystallinity (18.2%). The accelerated stability study revealed that the solid dispersions are less stable than SINV, with PEG-2(SD) being the least stable, confirmed by FTIR and DSC. The analyses by PDRX-TOPAS revealed the amorphous character of the dispersions and the mechanism of increasing solubility / Esta tese teve como objetivo avaliar o aumento de solubilidade da sinvastatina (SINV) atrav?s de dispers?es s?lidas utilizando as t?cnicas de malaxagem (MA), evapora??o com co- solvente (ES), fus?o com carreador (FC) e secagem por spray dryer (SD). Foram utilizados os carreadores Soluplus (SOL), PEG 6000 (PEG), PVP K-30 (PVP) e lauril sulfato de s?dio (LSS). As dispers?es s?lidas contendo PEG [PEG-2(SD)], Soluplus [SOL-2(MA)] e lauril sulfato de s?dio [LSS-2(ES)] apresentaram maior aumento de solubilidade (5,02; 5,60 e 5,43 vezes, respectivamente); a an?lise por ANOVA entre os tr?s grupos n?o demonstrou diferen?a significativa (p<0,05). No estudo de solubilidade de fases, o c?lculo da energia livre de Gibbs (&#916;G) revelou que a espontaneidade de solubiliza??o da SINV ocorreu na ordem SOL>PEG >PVP 75%>LSS, sempre a 80%. Os diagramas de fases de PEG e LSS apresentaram estequiometria de solubiliza??o 1:1 (tipo AL). Os diagramas de PVP e SOL possuem uma tend?ncia a estequiometria 1:2 (tipo AL + AP). Os valores de coeficiente de estabilidade (Ks) dos diagramas de fases revelaram que as rea??es mais est?veis ocorreram com LSS e PVP. As dispers?es s?lidas foram caracterizadas atrav?s de infravermelho com transformada de Fourier (FTIR), calorimetria explorat?ria diferencial (DSC), microscopia eletr?nica de varredura (MEV), distribui??o de tamanho de part?cula (DTP), espectroscopia de imagem no infravermelho pr?ximo (NIR-CI) e difratometria de raios X do P? utilizando o software Topas (PDRX-TOPAS). A dispers?o s?lida PEG-2(SD) apresentou a maior homogeneidade e o menor grau de cristalinidade (18,2%). O estudo de estabilidade revelou que as dispers?es s?lidas s?o menos est?veis que SINV, sendo PEG-2(SD) a de menor estabilidade, confirmada por FTIR e DSC. As an?lises por PDRX-TOPAS revelaram a cristalinidade das dispers?es e o mecanismo de aumento de solubilidade